The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Heads-up limit hold’em poker is solved
Abstract
I'll see your program and raise you mine: One of the fundamental differences between playing chess and two-handed poker is that the chessboard and the pieces on it are visible throughout the entire game, but an opponent's cards in poker are private. This informational deficit increases the complexity and the uncertainty in calculating the best course of action—to raise, to fold, or to call. Bowling et al.now report that they have developed a computer program that can do just that for the heads-up variant of poker known as Limit Texas Hold 'em (see the Perspective by Sandholm). Science, this issue p.145; see also p.122
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
Zur Theorie der Gesellschaftsspiele
v. Neumann, J. (1928) · Mathematische Annalen · doi:10.1007/bf01448847 · Cited by 2,572
Campbell, M., Hoane, A. J., & Hsu, F.-H. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00129-1 · Cited by 1,226
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
Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., & Sutphen, S. (2007) · Science · doi:10.1126/science.1144079 · Cited by 443
Self-citationSecurity and Game Theory: Algorithms, Deployed Systems, Lessons Learned
Tambe, M. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511973031 · Cited by 322
Billings, D., Davidson, A., Schaeffer, J., & Szafron, D. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00130-8 · Cited by 266
Efficient Computation of Equilibria for Extensive Two-Person Games
Koller, D., Megiddo, N., & von Stengel, B. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0051 · Cited by 228
The complexity of two-person zero-sum games in extensive form
Koller, D., & Megiddo, N. (1992) · Games and Economic Behavior · doi:10.1016/0899-8256(92)90035-q · Cited by 207
Chinook: The World Man-Machine Checkers Champion
Schaeffer, J., Lake, R., Lu, P., et al. (1996) · Cited by 150
The State of Solving Large Incomplete‐Information Games, and Application to Poker
Sandholm, T. (2010) · AI Magazine · doi:10.1609/aimag.v31i4.2311 · Cited by 116
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
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
Moravčík, M., Schmid, M., Burch, N., Lisý, V., Morrill, D., Bard, N., Davis, T., Waugh, K., Johanson, M., & Bowling, M. (2017) · Science · doi:10.1126/science.aam6960 · Cited by 786
Self-citationDeep Reinforcement Learning: An Overview
Li, Y. (2017) · arXiv · doi:10.48550/arxiv.1701.07274 · Cited by 762
A survey and critique of multiagent deep reinforcement learning
Hernandez-Leal, P., Kartal, B., & Taylor, M. E. (2019) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-019-09421-1 · Cited by 671
Metadata
- Authors
- Bowling, M., Burch, N., Johanson, M., & Tammelin, O.
- Venue
- Science
- Published
- 2015-01-09
- Volume
- 347
- Issue
- 6218
- Pages
- 145-149
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2006791053
- Cited by
- 338
- References
- 12
- FWCI
- 34.10
- 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: Heads-up limit hold’em poker is solved. https://app.cochat.ai/papers/10.1126/science.1259433
- The paper
- Bowling, M., Burch, N., Johanson, M., & Tammelin, O. (2015). Heads-up limit hold’em poker is solved. Science. https://doi.org/10.1126/science.1259433
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.