Superhuman AI for multiplayer poker
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Yet, although AI outperforms humans in an ever-broadening range of tasks, from playing poker (20) and Go (21) to translating languages (22) and diagnosing skin cancer (23), it trails far behind when it comes to ToM.”
From Evaluating large language models in theory of mind tasks (2024) · cites this paper as [20]
In the citing paper
“This ability to strategically misrepresent information helped Pluribus become the first AI system to achieve superhuman performance in heads-up, no-limit Texas hold ’em poker.”
From AI deception: A survey of examples, risks, and potential solutions (2024) · cites this paper as [7]
In the citing paper
“Pluribus demonstrated a clear ability to bluff in a video of its game against five professional human poker players.”
From AI deception: A survey of examples, risks, and potential solutions (2024) · cites this paper as [7]
Citations
Cites
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Mastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084 · cited 2×
“Real-time search has been necessary for achieving super-human performance in many perfect-information games, including backgammon ( 18 ), chess ( 8 ), and Go ( 9 , 19 ).”
BackgroundMethodNash, J. (1951) · The Annals of Mathematics · doi:10.2307/1969529 · Cited by 7,002
Nash, J. (1989) · Cournot Oligopoly · doi:10.1017/cbo9780511528231.007 · Cited by 5,595
Zur Theorie der Gesellschaftsspiele
v. Neumann, J. (1928) · Mathematische Annalen · doi:10.1007/bf01448847 · Cited by 2,572
Temporal difference learning and TD-Gammon
Tesauro, G. (1995) · Communications of the ACM · doi:10.1145/203330.203343 · Cited by 1,618 · cited 2×
“Real-time search has been necessary for achieving super-human performance in many perfect-information games, including backgammon ( 18 ), chess ( 8 ), and Go ( 9 , 19 ).”
BackgroundMethodCampbell, M., Hoane, A. J., & Hsu, F.-H. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00129-1 · Cited by 1,226
The Complexity of Computing a Nash Equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009) · SIAM Journal on Computing · doi:10.1137/070699652 · Cited by 921
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
Temporal Difference Learning and TD-Gammon
Tesauro, G. (1995) · ICGA Journal · doi:10.3233/icg-1995-18207 · Cited by 764
Research works printed but not linked: 26
- S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2011) pp. 533–540.
- K. Berg T. Sandholm AAAI Conference on Artificial Intelligence (AAAI) (2017).
- L. S. Shapley Advances in Game Theory M. Drescher L. S. Shapley A. W. Tucker Eds. (Princeton Univ. Press 1964).
- T. Sandholm in AAAI Conference on Artificial Intelligence (AAAI) (2015) pp. 4127–4131. Senior Member Track.
- M. Johanson N. Burch R. Valenzano M. Bowling in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2013) pp. 271–278.
- S. Ganzfried T. Sandholm in AAAI Conference on Artificial Intelligence (AAAI) (2014) pp. 682–690.
- N. Brown S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2015) pp. 7–15.
- M. Zinkevich M. Johanson M. H. Bowling C. Piccione in Neural Information Processing Systems (NeurIPS) (2007) pp. 1729–1736.
- E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information (2013).
- E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information (2016).
- N. Brown T. Sandholm in International Joint Conference on Artificial Intelligence (IJCAI) (2016) pp. 4238–4239.
- E. G. Jackson AAAI Workshop on Computer Poker and Imperfect Information Games (2017).
- M. Lanctot K. Waugh M. Zinkevich in M. Bowling Neural Information Processing Systems (NeurIPS) (2009) pp. 1078–1086.
- M. Johanson N. Bard M. Lanctot R. Gibson M. Bowling in International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2012) pp. 837–846.
- R. Gibson M. Lanctot N. Burch D. Szafron M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2012) pp. 1355–1361.
- N. Brown T. Sandholm AAAI Conference on Artificial Intelligence (AAAI) (2019).
- S. Ganzfried T. Sandholm in International Joint Conference on Artificial Intelligence (IJCAI) (2013) pp. 120–128.
- N. Brown T. Sandholm B. Amos in Neural Information Processing Systems (NeurIPS) (2018) pp. 7663–7674.
- M. Johanson K. Waugh M. Bowling M. Zinkevich in International Joint Conference on Artificial Intelligence (IJCAI) (2011) pp. 258–265.
- N. Burch M. Schmid M. Moravcik D. Morill M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2018) pp. 949–956.
- K. Waugh AAAI Workshop on Computer Poker and Imperfect Information (2013).
- A. Gilpin T. Sandholm T. B. Sørensen in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) (2007) pp. 50–57.
- S. Ganzfried T. Sandholm in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (2015) pp. 37–45.
- N. Burch M. Johanson M. Bowling in AAAI Conference on Artificial Intelligence (AAAI) (2014) pp. 602–608.
- M. Moravcik M. Schmid K. Ha M. Hladik S. Gaukrodger in AAAI Conference on Artificial Intelligence (AAAI) (2016) pp. 572–578.
- N. Brown T. Sandholm in Neural Information Processing Systems (NeurIPS) (2017) pp. 689-699.
Cited by
Items 601–679 of 679
Modeling Physiological and Neuronal Systems
Sawicki, J. (2025) · Current research in systematic musicology · doi:10.1007/978-3-031-97003-0_4
Dominated Strategy Elimination Based on the Regret Minimization Algorithm
Feng, T., Ju, Q., Luo, Y., & Fang, Z. (2025) · International Symposium on Big Data and Applied Statistics (ISBDAS) · doi:10.1109/isbdas64762.2025.11117090
“If dominated strategies in the game (e.g., folding without raising in poker [5]) can be eliminated, the training process can be significantly accelerated.”
Explicit cooperation mechanism and multimodal fusion prediction model empower DouDizhu agents
Wang, J., Fu, L., Li, X., Luo, H., & Guo, Z. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.113823
Breakthrough applications of artificial intelligence in Texas Hold'em poker
Liu, F. (2025) · ITM Web of Conferences · doi:10.1051/itmconf/20257801020
Tree Search for Simultaneous Move Games via Equilibrium Approximation
Yu, R., Olshevsky, A., & Chin, P. S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-08064-6_1
A2CHoldem: An Intelligent Agent for Texas Hold’em Based on Deep Reinforcement Learning
Guo, Q., Wang, Y., Wang, S., & Zhao, T. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227788
Dang, T., Tran, H., Howard, B., Charoenphon, S., & Nguyen, D. T. (2025) · AI Matters · doi:10.1145/3774399.3774403
“…learning algorithms using self-play and extensive training enable AI to challenge humans in Chess and Shogi (Silver et al., 2018), while Brown and Sandholm developed Pluribus, an AI model that achieved superhuman performance in six player no-limit Texas hold ’em poker (Brown & Sandholm, 2019).”
Self-Learning Longitudinal Control for On-Road Vehicles
Puccetti, L. (2023) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000156193
Polynomial-time linear-swap regret minimization in imperfect-information sequential games
Pipis, C. (2023) · DSpace - NTUA (National Technical University of Athens) · doi:10.26240/heal.ntua.26149
On the Foundations of Universal Artificial Intelligence
Carpenter Catt, E. (2023) · ANU Open Research (Australian National University) · doi:10.25911/3pgj-2a65 · Cited by 1
Proseminar Mobile Computing SS 2023 : Mobile und Verteilte Systeme Ubiquitous Computing. Teil XX
Studt, A., Tremper, P., Li, C., Zhao, H., & Beigl, M. (2024) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000170114
Kukkonen, K. (2023) · UTUPub (University of Turku) · Cited by 4
Winning at Pokémon Random Battles Using Reinforcement Learning
Wang, J. (2024) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Frosterud, A., & Beck-Friis Sandholm, S. (2025) · KTH Publication Database DiVA (KTH Royal Institute of Technology)
Learning Continuous and Pure Bayes-Nash Equilibria in Sealed-Bid Auctions
Heidekrüger, S., Bichler, M., & München, T. U. (2023)
Hamel, A. (2020) · Corpus Université Laval (Université Laval)
Algoritmi za iskanje Nashevega ravnovesja v bimatričnih igrah
Leonardis, T. J. (2024) · Repository of the University of Ljubljana (University of Ljubljana)
Explaining the future context of deep reinforcement learning agents’ decision-making
Towers, M. (2025) · ePrints Soton (University of Southampton) · Cited by 1
Törö, A. (2025) · LUTPub (LUT University)
Addressing deep reinforcement learning: empirical algorithm performance evaluations∗
Dubb, R. (2025) · Open University of Cape Town (University of Cape Town)
Uncertainty aspects in Texas hold'em poker AIs : a comparative analysis
Schmid, A. (2025) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-17216
LeadGenius: Mastering opening leads in the game of bridge
Zhang, Z., You, D., Yao, S., Wang, S., & Zhou, M. (2025) · Information Sciences · doi:10.1016/j.ins.2025.122794
Technical methods for governing AI agents
Chan, A. (2025) · doi:10.71781/10081
Broad forest regression for industrial modeling
Tang, J., Yu, W., Qiao, J., & Zhu, Q. M. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-31564-0.00003-6
Riepe, M. (2025) · Amtliche Mitteilungen (Universitätsbibliothek Paderborn) · doi:10.17619/unipb/1-2437
Drafting Magic: The Gathering With High-Dimensional Card Embeddings
Bertram, T., Furnkranz, J., & Muller, M. (2025) · IEEE Transactions on Games · doi:10.1109/tg.2025.3646029
“Whilesuperhumanperformancehasbeenachievedin games,suchas Go , chess , DOTA, and Poker [1], [7], [20], many others still pose significant challenges.”
Direct Optimization of Portfolios of Counter Strategies
Drabent, K. K., & Lisý, V. (2025) · International Conference on Distributed Artificial Intelligence (DAI) · doi:10.1145/3772429.3772437
Chen, Z., Liu, K., Wang, J., & Ke, J. (2026) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2025.104651
Partially Observable RL: Benign Structures and Simple Generic Algorithms
Liu, Q., & Jin, C. (2025) · Statistical Science · doi:10.1214/25-sts1012
Simplifying Imperfect Recall Games
Gimbert, H., Paul, S., & Srivathsan, B. (2025) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/cphe4108
RPCFR+: Achieving Faster Convergence in Predictive CFR Through Robust Historical Weighting
Yang, Z., & Sun, M. (2025) · International Conference on Machine Learning and Computer Application (ICMLCA) · doi:10.1109/icmlca66850.2025.11336349
Cognitive models facilitate real-time inference of latent motives
Fitch, A. K., & Kvam, P. D. (2026) · Scientific Reports · doi:10.1038/s41598-026-37587-8
Gargano, I. E., von Ellenrieder, K. D., & Vivolo, M. (2026) · Research Square · doi:10.21203/rs.3.rs-8916440/v1
Aces and Kings – A Game Theory Analysis of a Reduced Poker Model
Vanukuri, M. R. (2025) · UA Campus Repository (The University of Arizona)
Zhang, S., Yang, P., Zeng, Z., & Zhang, J. (2026) · IEEE Transactions on Games · doi:10.1109/tg.2026.3675377
Nash equilibrium strategy solving in two-player imperfect-information games: a survey
Li, H., Wang, Z., Yang, Z., Qi, S., & Zhang, J. (2026) · Artificial Intelligence Review · doi:10.1007/s10462-026-11533-6
SkyNet: Belief-Aware Planning in Partially Observable Stochastic Games
Haile, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-38404-1_9
Efficient representations for team and imperfect-recall equilibrium computation
Carminati, L., Zhang, B. H., Cacciamani, F., Li, J., Farina, G., Gatti, N., & Sandholm, T. (2026) · Artificial Intelligence · doi:10.1016/j.artint.2026.104529
Self-citationIntrinsically Motivated and Interactive Reinforcement Learning : a Developmental Approach
Fournier, P. (2019) · theses.fr (ABES) · doi:10.70675/525d96caz1d44z4f9cz86bfzb69a83bf40b5 · Cited by 1
“…Learning “frenzy” has gained the field of RL and made possible impressive achievements, among which mastering boardgames like go (Silver et al. 2016), real-time strategy games like Dota (OpenAI 2018) and Starcraft (Vinyals et al. 2019), or multi-player games like poker (Brown and Sandholm 2019).”
BackgroundFoulquier, N. (2020) · theses.fr (ABES) · doi:10.70675/8bdb67b7zc381z45ccza28fz71978e1e325c
Anti-Submarine Warfare Planning Using Public Belief States and Self-Play
Limér, C., Brynielsson, J., Cohen, M., & Rydell, F. (2025) · International Conference on Machine Learning and Applications · doi:10.1109/icmla66185.2025.00185
“Most notably, bots are now unbeatable in poker, including the most demanding forms of poker [2].”
Scaling up Multi-agent Reinforcement Learning with Mean Field Games and Vice-versa
Perrin, S. (2022) · theses.fr (ABES) · doi:10.70675/11dd67a8z7811z4c4bza260zd146314c100f · Cited by 4
Sampling-Based Search Algorithms in Games
Arjonilla, J. (2024) · theses.fr (ABES) · doi:10.70675/4aecc884z634bz4a43z9289z6350a24f1d61
Games with incomplete information : complexity, algorithmics, reasoning
Li, J. (2023) · theses.fr (ABES) · doi:10.70675/9095d69azf412z43c2za047ze8e9d974bb22
RainbowCFR: Deep Counterfactual Regret Minimization with Rainbow DQN
Liu, J., Sun, Y., & Wang, X. (2026) · International Symposium on Computer Applications and Information Systems (ISCAIS) · doi:10.1109/iscait69154.2026.11477448
“RainbowCFR dynamically fuses neural value estimation with Monte Carlo returns to reduce early-stage variance and improve convergence stability [9]–[11].”
Olivas, E. S., Belda, E. A., Salvador, D. B., Cámara, P. H., Isla, M. A. S.-M., & Belenguer, P. R. (2026) · Studies in computational intelligence · doi:10.1007/978-3-032-15854-3_7
Reinforcement Learning for 4×4 Tic-Tac-Toe: Q-Learning with Tactical Enhancements and Epsilon Decay
Madhavan, D., Manas, T., Zahwa, K., Reddy, S., & Sripriyan, K. (2026) · International Conference on Emerging Smart Computing and Informatics (ESCI) · doi:10.1109/esci68015.2026.11493322
“Brown and Sandholm [4] further advanced the field by demonstrating su-perhuman performance in multiplayer poker—a game characterized by hidden information—showing just how effective RL can be in multi-agent scenarios.”
Dynamic Cognitive Hierarchy Model with Regret Minimization for Two-Player Extensive-Form Games
Li, C., & Zeng, X. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-95-8329-4_49
Rangel, J. G. C., Escalante, J. C., Castellanos, J. E. C., & Guerrero, H. (2024) · Revista Formación Estratégica · doi:10.21897/rii.4330
An Optimization Method of Texas Hold’em DQN Algorithm for Fraud Detection
Tu, F., Yuan, H., Zhang, X., Liu, L., Wang, H., & He, Y. (2025) · Asian Conference on Artificial Intelligence Technology (ACAIT) · doi:10.1109/acait67930.2025.11522592
PokerOWL: A Multi-Agent Poker Environment for Benchmarking Open-World Learning
Chiu, M., Nananukul, N., & Kejriwal, M. (2026) · Applied Sciences · doi:10.3390/app16115458
Zhang, L., Cai, D., & Wang, X. (2026) · Applied Sciences · doi:10.3390/app16115711
“Building upon these foundations, Pluribus further extended CFR-based techniques to the substantially more complex setting of six-player no-limit Texas Hold’em, marking a significant step forward in the study of multi-agent imperfect-information games [39].”
A Hierarchical and Risk-Aware Decision Framework for Riichi Mahjong AI
Zheng, H. (2026) · Applied and Computational Engineering · doi:10.54254/2755-2721/2026.34448
Pietryga, A. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6920358
Liu, W., & Peltz, G. (2026) · Advanced Science · doi:10.1002/advs.76484
“Unlike its predecessors, AI 4.0 breaks free from the single-pass constraint by scaling up and optimizing the “test-time compute” paradigm [ 24–26 ], granting the system the time and computational resources to “think,” reason, and build upon its training data before providing a response.”
InfluentialMaking Mahjong Agents Interpretable: A Parameterized Search Approach
Li, L., Lu, Y., Wang, Y., Zheng, Q., & Li, W. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-9667-6_8
peng, Y., Ning, H., & Ding, J. (2026) · Research Square · doi:10.21203/rs.3.rs-10348457/v1
Sirniö, S. (2026) · Osuva (University of Vaasa)
On Creating Human Models in Poker with Deep Learning and Regularized Search
Chen, N. (2026) · DSpace@MIT (Massachusetts Institute of Technology)
Yahya, S., Liew, S., Karthik, R., & Liew, J. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7272558
Separation of Nonergodic Uniform Convergence Rates for Regularized Learning in Games
Cai, Y., Farina, G., Grand-Clément, J., Kroer, C., Lee, C.-W., Luo, H., & Zheng, W. (2026) · Operations Research · doi:10.1287/opre.2025.2166
The Interpretability–Complexity Paradox in Deep Materials Networks
Martins, B., Pereira, L., & Azevedo, R. (2023) · Journal of Computational and Data-Driven Materials Engineering · doi:10.68159/u249642833
New Metrics, New Styles: Customizing Rewards to Influence Agent Play
Triglia, L., Guerrieri, V., Barros, P. V. A., Rea, F., & Sciutti, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-38404-1_10
Private information inference from bargaining decisions using deep learning
Cui, L., & Yu, H. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.116504
Kujur, A. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-39395-1_7
Supervised Fine-Tuning of Large Language Models for Strategic Decision-Making in Poker
Diniz, L. D. O., & Carneiro, M. G. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-39895-6_7
(2026) · Issues in Information Systems · doi:10.48009/1_iis_2026_148
Applying AlphaZero Algorithm to an Imperfect Information Card Game
Krappe, S. (2026) · UTUPub (University of Turku)
SafeAdapt-Poker: Counterfactual Risk Calibration for Budgeted Adaptation under Opponent ShiftPreprint
Hu, M., Hu, S., Guo, X., Wang, X., Wang, B., Chen, R., & Zha, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.20473
Use and application of LLMs in bot development for NLHE
Korzhenkov, A. M. (2026) · Docta Complutense (Universidad Complutense de Madrid)
Language-Guided Value with Latent Dynamics for Textual Card Game Agent
Xia, W., Xu, S., & Xu, B. (2026) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn69854.2026.11729694
Computational modeling of social interactions
Votinov, M. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-34080-2.00020-2
Gu, F., & Boyd-Graber, J. L. (2026) · IntechOpen eBooks · doi:10.5772/intechopen.1018041
Mastering Baghchal by Self-Play with Deep Reinforcement LearningPreprint
Raut, R., Subedi, A., & Rai, S. (2026) · Research Square · doi:10.21203/rs.3.rs-11122640/v1
Ruan, Z., Wan, Y., Yu, L., Lin, Z., Wang, B., Liang, Y., 刘自力, Wang, X., & Wang, J. (2026) · Chinese Optics Letters · doi:10.3788/col202624.101302
TaskFrame: Connecting Task-Level Planning with Frame-Level Control for Game AgentsPreprint
Wang, G.-Z., Pu, J., Wang, Y.-R., Yin, X., Chen, H.-H., Cheng, C., Li, L.-G., Zhou, Y.-N., Wu, J.-R., Jiang, Y.-N., et al. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.40276 · Cited by 2
“Existing efforts have reached or surpassed expert human performance in board games, Atari, multiplayer poker, and complex real-time strategy games (Silver et al., 2016, 2017; Schrittwieser et al., 2020; OpenAI et al., 2019; Badia et al., 2020; Brown and Sandholm, 2019; Vinyals et al., 2019).”
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)
- 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
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.