Linked from

The 18 pages that link to Game tree, each with the reason it gives.

• MinimaxRelated: Minimax evaluates branches of a game tree from terminal outcomes back to the current position.

• Combinatorial game theoryRelated: Game trees encode every continuation from a position.

• Repeated gameRelated: A repeated interaction can be represented as a tree of histories and future choices.

• Subgame perfect equilibriumRelated: Its decision nodes and branches make candidate subgames visible.

• Perfect informationRelated: A perfect-information game’s tree exposes the path of past actions at each decision point.

• Binary treeRelated: Games with two choices at each state can be modeled as binary trees.

• Turn-based strategyRelated: Each turn extends the tree of possible plans and counterplans.

• Axiom of determinacyRelated: Strategies select moves at nodes, while infinite branches represent plays.

• Sprague–Grundy theoremRelated: The theorem’s recursive values are computed from the options in this tree.

• StrategoRelated: Hidden ranks enlarge the uncertainty around the consequences of each attack.

• Nine Men's MorrisRelated: Its immense search space explains the computational challenge of solving Morris.