CMU 07-280 Lecture 3: Minimax, Alpha-Beta, and Expectimax
Lecture 3 turns a single path into a contingent plan: minimax faces an optimal opponent, alpha-beta skips branches without changing the root value, and expectimax replaces worst-case choice with probability.