14 Apr 2005
CS 3243 - Revision
22
agent’s move then opponent’s
Adversarial Search
¡Turn-taking,
two-player, zero-sum games
¡Minimax algorithm:
lOne ply:
lMax nodes: agent’s
move, maximize utility
lMin nodes: opponent’s
move, minimize utility
lAlpha-Beta pruning: rid
unnecessary computation.