Question1. Implement the Isola game using MinMax and Alpha Beta purning algorithms. Instructions regarding game are given below.
• Each of the two players has one piece.
• The board has 7´7 positions which initially contain squares, except for the initial positions of the pieces.
• A move consists of two subsequent actions:
o moving one's piece to a neighboring (horizontally, vertically, or diagonally) field that contains a square but not the opponent's piece,
o removing the square with movement of piece on it.
• If a player cannot move any more, he/she loses the game.
Answers
Answered by
2
Explanation:Minimax is a kind of backtracking algorithm that is used in decision making and game theory to find the optimal move for a player, assuming that your opponent also plays optimally. It is widely used in two player turn-based games such as Tic-Tac-Toe, Backgammon, Mancala, Chess, etc.
In Minimax the two players are called maximizer and minimizer. The maximizer tries to get the highest score possible while the minimizer tries to do the opposite and get the lowest score possible.
Similar questions