© 2000 Todd Neller.  A.I.M.A. text figures © 1995 Prentice Hall.  Used by permission.
Example of Game-Tree Search
•Search: Tic-Tac-Toe
–players place X and O in turn.
–Initial state: empty 3´3 grid
–Goal state: three of a player's symbol in a row
–Count win = +1, draw = 0, loss = -1
–Find sequence of move which maximizes utility regardless of adversarial play
x
x
x
x
x
o
o
x
x
x
o
o
draw
0
…
…
…
…