Game tree
A game tree is a branching representation whose nodes denote game states and whose edges denote possible moves between them.
Grokking AI Algorithms, Second Edition
A tree representation whose nodes are game states and whose branches represent possible moves between them.
- How it is used
- Represents possible game futures for Minimax search and decision-making.
- How deep it goes
- Explains nodes, branches, leaves, alternating turns, heuristic evaluation, and depth limits, but not full-tree feasibility beyond resource constraints.
- Examples
- Uses simulated alternating turns, heuristic-scored leaf states, and Connect Four positions as concrete examples.
- What you can do after
- Apply it via Minimax search to organize valid moves, simulate future states, and compare resulting scores.
Read how Grokking AI Algorithms, Second Edition explains game tree →
Inside AI
A game tree is a branching representation whose nodes denote game states and whose edges denote states reachable through legal moves.
- How it is used
- Models the branching possibilities that arise when computers analyze turn-based games.
- How deep it goes
- Defines nodes, edges, branching, and scale, then briefly connects the structure to endpoint evaluation in game programming.
- Examples
- Uses chess positions, move counts, the Shannon number, and IBM’s Deep Blue as concrete illustrations.
- What you can do after
- Evaluate the scale and structure of possible moves when reasoning about computer game-playing systems.
Applied Reinforcement Learning
A game tree is a tree representing possible states and moves in a strategic game or other sequential decision process.
- How it is used
- Maps strategic decisions into possible states and moves, providing the tree structure used by Monte Carlo Tree Search.
- How deep it goes
- Defines nodes and branches, then demonstrates a small route tree with Python code.
- Examples
- Illustrates branching choices with depot routes, delivery zones, and customer visit order.
- What you can do after
- Build it from scratch as a Python tree of route decisions, costs, and child nodes.
Read how Applied Reinforcement Learning explains game tree →
Also covered in
Related concepts
- treekind of · A tree is a connected, acyclic structure of nodes organized through parent-child relationships, typically around a single root.
- Monte Carlo Tree Searchused by · Monte Carlo Tree Search is a decision-making algorithm that explores a search tree using repeated sampling or simulation to estimate the value of actions.
- Tic-Tac-Toeuses · Tic-Tac-Toe is a two-player game in which players alternately place marks on a three-by-three grid and seek a line of three matching marks.
- alpha-beta pruningaddressed by · Alpha-beta pruning is an optimization of minimax search that eliminates game-tree branches unable to affect the final decision.
- minimax algorithmused by · A game-search algorithm that alternates maximizing an agent's score and minimizing the opponent's score while exploring possible future moves.
Questions about game tree
What is game tree?
A game tree is a branching representation whose nodes denote game states and whose edges denote possible moves between them.
Which Manning books explain game tree?
Grokking AI Algorithms, Second Edition, Inside AI and Applied Reinforcement Learning.
What is game tree a kind of?
Game tree is a kind of tree. A tree is a connected, acyclic structure of nodes organized through parent-child relationships, typically around a single root.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.


