The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Checkers Is Solved
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Theory of games and economic behavior
(2019) · 100 Years of Math Milestones · doi:10.1090/mbk/121/32 · Cited by 16,632
The Retinex Theory of Color Vision
Land, E. H. (1977) · Scientific American · doi:10.1038/scientificamerican1277-108 · Cited by 2,981
An analysis of alpha-beta pruning
Knuth, D. E., & Moore, R. W. (1975) · Artificial Intelligence · doi:10.1016/0004-3702(75)90019-3 · Cited by 1,004
Programming a computer for playing chess
Shannon (1950) · The Philosophical Magazine A Journal of Theoretical Experimental and Applied Physics · Cited by 770
XXII. Programming a computer for playing chess
Shannon, C. E. (1950) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786445008521796 · Cited by 615
Games solved: Now and in the future
van den Herik, H. J., Uiterwijk, J. W. H. M., & van Rijswijck, J. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00152-7 · Cited by 256
Cited by
Rahwan, I., Cebrian, M., Obradovich, N., Bongard, J., Bonnefon, J.-F., Breazeal, C., Crandall, J. W., Christakis, N. A., Couzin, I. D., Jackson, M. O., et al. (2019) · Nature · doi:10.1038/s41586-019-1138-y · Cited by 1,364
Monte Carlo Tree Search: a review of recent modifications and applications
Świechowski, M., Godlewski, K., Sawicki, B., & Mańdziuk, J. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10228-y · Cited by 365
Machado, M. C., Bellemare, M. G., Talvitie, E., Veness, J., Hausknecht, M., & Bowling, M. (2018) · Journal of Artificial Intelligence Research · doi:10.1613/jair.5699 · Cited by 359
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Heads-up limit hold’em poker is solved
Bowling, M., Burch, N., Johanson, M., & Tammelin, O. (2015) · Science · doi:10.1126/science.1259433 · Cited by 338
Self-citation
Metadata
- Authors
- Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., & Sutphen, S.
- Venue
- Science
- Published
- 2007-09-14
- Volume
- 317
- Issue
- 5844
- Pages
- 1518-1522
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1995987707
- Cited by
- 443
- References
- 6
- FWCI
- 29.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Checkers Is Solved. https://app.cochat.ai/papers/10.1126/science.1144079
- The paper
- Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., & Sutphen, S. (2007). Checkers Is Solved. Science. https://doi.org/10.1126/science.1144079
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.