Jonathan Schaeffer1, Neil Burch, Yngvi Björnsson
1Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada. jonathan@cs.ualberta.ca
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Checkers has been solved, proving that perfect play from both sides results in a draw. This landmark achievement in artificial intelligence (AI) tackles the game's immense complexity, estimated at 5 x 10^20 possible positions.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: