General Approach to Game Playing by Search
Expand the tree some fixed number of moves
Apply a heuristic evaluation function to the (incomplete) state
Apply MINIMAX to compute the best first move
Example: TIC-TAC-TOE
- players are MAX (drawing X’s) and MIN (drawing O’s)
- e(p) is
- ? if p is a win for MAX
- -? if p is a win for MIN
- (number of available rows/columns/diagonals for MAX) - (number of available rows/columns/diagonals) for MIN)