Linked from

The 14 pages that link to Minimax, each with the reason it gives.

• Game treeRelated: Minimax evaluates alternating choices from terminal outcomes back to the root.

• Game stateRelated: Search evaluates candidate moves by tracing their resulting states.

• Minimax theoremRelated: The opposing optimization reaches the same value as maximin.

• Turn-based strategyRelated: It formalizes planning against an opponent who can answer after each move.

• Rock paper scissorsRelated: Uniform randomization limits the advantage an opponent can gain from predicting a gesture.

• Tic-tac-toeRelated: It identifies moves that prevent a perfect opponent from winning.

• MancalaRelated: Computer programs can use minimax to evaluate moves in finite mancala variants.

• Computer chessRelated: Chess engines use it to compare moves against the strongest anticipated replies.

• Nine Men's MorrisRelated: It provides a basic framework for selecting moves in adversarial game search.

• ReversiRelated: It formalizes the goal of selecting moves that withstand the opponent's best response.

• Chess theoryRelated: It formalizes the adversarial logic behind calculating a chess variation.