The games this project considers are two-person, abstract strategy games such as Tic-Tac-Toe, Connect 4, and Mancala.
The family of abstract games shares a set of characteristics that allow for computational solvability. These characteristics are:
- Perfect information, meaning that all information must be available to both players at all times.
- No chance, which implies no dice, shuffling, or spinning
Together, these properties allow for strong, non-probabilistic solutions which can be used to simulate a perfect computer player.
There are currently 68 games in our system.
Every game ever invented by mankind, is a way of making things hard for the fun of it!
— John Ciardi