3 Feb 2005
CS 3243 - Game playing
9
Properties of minimax
nComplete? Yes (if tree is finite)
nOptimal? Yes (against an optimal opponent)
nTime complexity? O(bm)
nSpace complexity? O(bm) (depth-first exploration)
n
nFor chess, b ≈ 35, m ≈ 100 for “reasonable” games
à exact solution completely infeasible
nWhat can we do?
nPruning!