Checkers Is Solved

Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen

doi:10.1126/science.1144079

Checkers Is Solved

DOI Web Site 被引用文献11件

Jonathan Schaeffer

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Neil Burch

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Yngvi Björnsson

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Akihiro Kishimoto

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Martin Müller

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Robert Lake

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Paul Lu

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.
Steve Sutphen

Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada.

抄録

<jats:p> The game of checkers has roughly 500 billion billion possible positions (5 × 10 <jats:sup>20</jats:sup> ). 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. </jats:p>