Tree shape

Branching factor b: 2 Depth d: 4

Algorithm

Pure minimax Alpha-beta

Move ordering

Random Best-first

Run

Speed: 6

Stats

Nodes total—

Nodes visited0

Leaves visited0

Cutoffs (α-β)0

Root value—

Best move—

MAX (red) picks the largest child value, MIN (blue) the smallest. Alpha-beta keeps a window (α, β); when β ≤ α the remaining siblings are pruned — shown crossed out.