April 2018
Intermediate to advanced
334 pages
10h 18m
English
Minimax was the algorithm used by IBM Deep Blue to beat the world champion Gary Kasparov on February 10, 1996 in a chess game. This win was a very big milestone back then. Both minimax and game trees are directed graphs, where each node represents the game states, that is, position in the game as shown in the following diagram of a game of tic-tac-toe:

Therefore, by searching the game tree an AI agent can pick the best possible move because of the combination of nodes and their ...