CoChat

Superhuman AI for multiplayer poker

Brown, Noam, Sandholm, Tuomas · 2019 · Science

The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.

Abstract

AI now masters six-player poker: Computer programs have shown superiority over humans in two-player games such as chess, Go, and heads-up, no-limit Texas hold'em poker. However, poker games usually include six players—a much trickier challenge for artificial intelligence than the two-player variant. Brown and Sandholm developed a program, dubbed Pluribus, that learned how to play six-player no-limit Texas hold'em by playing against five copies of itself (see the Perspective by Blair and Saffidine). When pitted against five elite professional poker players, or with five copies of Pluribus playing against one professional, the computer performed significantly better than humans over the course of 10,000 hands of poker. Science , this issue p. 885 ; see also p. 864

Overview

Integrity signals

Registry

Crossref · 10.1126/science.aay2400

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 24 references

Research works printed but not linked: 26

  1. S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2011) pp. 533–540.
  2. K. Berg T. Sandholm AAAI Conference on Artificial Intelligence (AAAI) (2017).
  3. L. S. Shapley Advances in Game Theory M. Drescher L. S. Shapley A. W. Tucker Eds. (Princeton Univ. Press 1964).
  4. T. Sandholm in AAAI Conference on Artificial Intelligence (AAAI) (2015) pp. 4127–4131. Senior Member Track.
  5. M. Johanson N. Burch R. Valenzano M. Bowling in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2013) pp. 271–278.
  6. S. Ganzfried T. Sandholm in AAAI Conference on Artificial Intelligence (AAAI) (2014) pp. 682–690.
  7. N. Brown S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2015) pp. 7–15.
  8. M. Zinkevich M. Johanson M. H. Bowling C. Piccione in Neural Information Processing Systems (NeurIPS) (2007) pp. 1729–1736.
  9. E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information (2013).
  10. E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information (2016).
  11. N. Brown T. Sandholm in International Joint Conference on Artificial Intelligence (IJCAI) (2016) pp. 4238–4239.
  12. E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information Games (2017).
  13. M. Lanctot K. Waugh M. Zinkevich in M. Bowling Neural Information Processing Systems (NeurIPS) (2009) pp. 1078–1086.
  14. M. Johanson N. Bard M. Lanctot R. Gibson M. Bowling in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2012) pp. 837–846.
  15. R. Gibson M. Lanctot N. Burch D. Szafron M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2012) pp. 1355–1361.
  16. N. Brown T. Sandholm AAAI Conference on Artificial Intelligence (AAAI) (2019).
  17. S. Ganzfried T. Sandholm in International Joint Conference on Artificial Intelligence (IJCAI) (2013) pp. 120–128.
  18. N. Brown T. Sandholm B. Amos in Neural Information Processing Systems (NeurIPS) (2018) pp. 7663–7674.
  19. M. Johanson K. Waugh M. Bowling M. Zinkevich in International Joint Conference on Artificial Intelligence (IJCAI) (2011) pp. 258–265.
  20. N. Burch M. Schmid M. Moravcik D. Morill M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2018) pp. 949–956.
  21. K. Waugh AAAI Workshop on Computer Poker and Imperfect Information (2013).
  22. A. Gilpin T. Sandholm T. B. Sørensen in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) (2007) pp. 50–57.
  23. S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2015) pp. 37–45.
  24. N. Burch M. Johanson M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2014) pp. 602–608.
  25. M. Moravcik M. Schmid K. Ha M. Hladik S. Gaukrodger in AAAI Conference on Artificial Intelligence (AAAI) (2016) pp. 572–578.
  26. N. Brown T. Sandholm in Neural Information Processing Systems (NeurIPS) (2017) pp. 689-699.

Cited by

See all 678

Metadata

Authors
Brown, N., & Sandholm, T.
Affiliations
  • Meta (United States) (US)
  • Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA.
Corresponding author
Brown, Noam
Venue
Science
Published
2019-08-30
Volume
365
Issue
6456
Pages
885-890
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2960876848
Cited by
592
References
24
Citations by year
2026: 34 · 2025: 77 · 2024: 81 · 2023: 83 · 2022: 88 · 2021: 125 · 2020: 77 · 2019: 27
FWCI
36.15
Type
journal article
Language
en
Open access
closed
Locations
  • Science (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Science Foundation (1718457, 1617590, 1733556)
  • Army Research Office (W911NF-17-1-0082)
  • Facebook
  • NSF XSEDE (CCR090023)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
Keywords
no-limit Texas Hold'Em, game AI, human-machine comparison
MeSH terms
Games, Recreational, Artificial Intelligence, Game Theory, Humans

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: Superhuman AI for multiplayer poker. https://app.cochat.ai/papers/10.1126/science.aay2400
The paper
Brown, N., & Sandholm, T. (2019). Superhuman AI for multiplayer poker. Science. https://doi.org/10.1126/science.aay2400

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.