|
|
Research Articles
Submitted on April 20, 2007 Checkers Is Solved
1 Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada. * To whom correspondence should be addressed.
The game of checkers has roughly 500 billion billion possible positions (5 x 1020). 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 more complex than 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.
The editors suggest the following Related Resources on Science sites:In Science Magazine
|
Science. ISSN 0036-8075 (print), 1095-9203 (online)
Magazine | News | Signaling | Careers | Multimedia | Collections | Help | Site Map | RSS
Subscribe | Feedback | Privacy / Legal | About Us | Advertise With Us | Contact Us
© 2007 American Association for the Advancement of Science. All Rights Reserved.
AAAS is a partner of HINARI, AGORA, PatientInform, CrossRef, and COUNTER.
You have reached the bottom of the page. Back to top