Minimax Algorithm

Consider a game of two players, call one of the players as MAX and the other player as MIN. And in the game MAX makes the first move and then they take turns alternatively till the end of the game.

The various components of the Game:

1. Initial State: This includes the board position and the player who will move first.
2. Successor Function: For a node it returns the list of it's successor function and the state they will result into.
3. Terminal States: The states where the game has ended.
4. Utility Function: This gives a numerical value to all the terminal states. High values are considered good for MAX and bad for MIN and vice-versa.

The following video gives a complete explanation of the Minimax Algorithm.

Following is the Minimax Algorithm:

Source: Artificial Intelligence: A Modern Approach