Affiliation:
1. Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Abstract
The game of checkers has roughly 500 billion billion possible positions (5 × 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.
Publisher
American Association for the Advancement of Science (AAAS)
Reference21 articles.
1. XXII. Programming a computer for playing chess
2. “The Duel: Man vs. Machine” (www.rag.de/microsite_chess_com).
3. One Jump Ahead 1997
4. M. Buro, IEEE Intell. Syst. J.14, 12 (1999).
5. B. Sheppard thesis Universiteit Maastricht Maastricht Netherlands (2002).
Cited by
248 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献