Display Settings:

Format

Send to:

Choose Destination
Science. 2007 Sep 14;317(5844):1518-22. Epub 2007 Jul 19.

Checkers is solved.

Author information

  • 1Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada. jonathan@cs.ualberta.ca

Abstract

The game of checkers has roughly 500 billion billion possible positions (5 x 10(20)). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper announces that checkers is now solved: Perfect play by both sides leads to a draw. This is the most challenging popular game to be solved to date, roughly one million times as complex as Connect Four. Artificial intelligence technology has been used to generate strong heuristic-based game-playing programs, such as Deep Blue for chess. Solving a game takes this to the next level by replacing the heuristics with perfection.

PMID:
17641166
[PubMed]
Free full text
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for HighWire
    Loading ...
    Write to the Help Desk