The Minimax algorithm is a backtracking method used in game theory to make decisions. By assuming that another player is likewise playing optimally, this algorithm offers the best moves for a player.
This method is based on two players, one of whom is known as MAX and the other as MIN.
The Minimax Algorithm uses the following terminologies:
-
Game tree: All potential moves are represented by a tree structure.
-
Initial State: The board in its basic state.
-
Terminal State: The location on the board where the game ends.
-
Utility Function: The function that gives the game’s outcome a numerical value.