3 Feb 2005
CS 3243 - Game playing
7
Minimax
nPerfect play for deterministic games
nIdea: choose move to position with highest minimax value
= best achievable payoff against best play
nE.g., 2-ply game:
nIdea: choose move to position with highest minimax value
= best achievable payoff against best play
nE.g., 2-ply game:
