Minimax Game Tree

CSC-266 · Semester IV · Artificial Intelligence

Minimax Game Playing

3-level tree: MAX at root, MIN at level 2, leaves are outcomes.

3

3

35

1

61

2

29

MAX picks the child with the highest score; MIN picks the lowest. Evaluated bottom-up, root = 3.

MIN(3,5)→3 · MIN(6,1)→1 · MIN(2,9)→2

MAX chooses the child with value 3.