Fun and games - Data Structures and Problem Solving Using Java - page 441

cannot be selected again. Players alternate until all grid elements in
the current row and column have been selected, at which point the
game ends and the player with the highest score wins.

Othello played on a 6 × 6 board is a forced win for black. Prove this
assertion by writing a program. What is the final score if play on both
sides is optimal?

10.14

references

If you are interested in computer games, a good starting point for information
is the article cited in [1]. In this special issue of the journal, devoted exclu-
sively to the subject, you will also find plenty of information and references to
other works covering Chess, Checkers, and other computer games.

K. Lee and S. Mahajan, “The Development of a World Class Othello
Program,” Artificial Intelligence 43 (1990), 21-36.

1.