CSE 472/572, Spring 2002, TIC-TAC-TOE STRATEGY

CSE 472/572, Spring 2002

TIC-TAC-TOE STRATEGY
(for player X)

if there are 2 Xs in a row, then make 3 Xs in a row
elsif there are 2 Os in a row, then block with an X
elsif 2 rows intersect with an empty square
       such that each row contains 1 X, no Os,
       then place X at the intersection
elsif 2 rows intersect with an empty square
       such that each row contains 1 O, no Xs,
       then place X at the intersection
elsif there are vacant corner square, then put X there
else place X on any vacant square.

From:

Zobrist, Albert L. (2000), "Computer Games: Traditional", in Anthony Ralston, Edwin D. Reilly, & David Hemmendinger (eds.), Encyclopedia of Computer Science, 4th edition (New York: Grove's Dictionaries): 364-368.

TIC-TAC-TOE STRATEGY (for player X)

TIC-TAC-TOE STRATEGY
(for player X)