Checkers Became An Unbeatable Draw

Checkers has been a solved game for almost 20 years. In 2007, after 18 years of work, University of Alberta computer scientist Jonathan Schaeffer and his team announced that they had solved checkers. Their proof established that perfect play by both opponents always produces a draw, making an optimal strategy unbeatable. At the time, checkers ranked as the most complex popular game ever solved, roughly one million times more complex than Connect Four.

Previous Fact Next Fact