Linked from

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

• Game stateNarrower topic: Each node represents a game state and each edge a possible move.

• 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.

• Alpha–beta pruningNarrower topic: Pruning removes subtrees from this representation rather than changing the game itself.

• 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.

• Extensive-form gameBroader topic: It displays the histories and terminal outcomes that define the game's structure.

• 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.

• Normal-form gameCompared with: Unlike a payoff table, a game tree can make the timing and sequence of choices explicit.

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

• Tic-tac-toeNarrower topic: Each legal mark creates a branch, and every complete path represents one game.

• 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.

• ReversiNarrower topic: Each Reversi position branches into the legal moves available to the player.

• Peg solitaireNarrower topic: Searching the tree exposes how branching jump sequences make solving difficult.