1. Give two heuristic functions for the 8-puzzle.
2. Explain minimax search. Use examples.
3. Explain alpha-beta pruning. Use examples.
1- Heuristic Function:
There are many heuristic functions for the 8-puzzle. Two of them are
i). Linear Conflicts.
ii). Pattern Database.
2- Minimax Search:
Minimax is an algorithm which uses backtracking to make
decisions and in games player uses game theory to find the best
move for the player. In multiplayer games minimax are widely
used.
Minimax is used in many games like
Backagon and Tic Tac Toe
3- Alpha-Beta Pruning:
Alpha-beta pruning is a derived part from minmax algorithm it
finds and decrease the number of turns or nodes in the tree.
Alpha-beta pruning allows to search faster and deeper in game tree.
When using a alpha-beta pruning function we have to send 2 more
variables that's why it is known as alpha-beta.
Gomoku
Chess
IF YOU HAVE ANY QUERY PLEASE COMMENT DOWN BELOW
PLEASE GIVE A THUMBS UP
Get Answers For Free
Most questions answered within 1 hours.