39. Define Minimax Algorithm and explains its terminologies.

Minimax refers to a recursive algorithm used for selecting an optimal move for a player assuming that the other player is also playing optimally.

However, a game can be specified as a search problem with the following elements:

• Firstly, Game Tree. This is a tree structure containing all the possible moves.
• Secondly, Initial state: The initial position of the board and displaying whose move it is.
• Thirdly, the Successor function. This specifies the possible legal moves a player can make.
• Then, Terminal state This refers to the position of the board when the game ends.
• Lastly, the Utility function. This assigns a numeric value for the outcome of a game.