{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T17:16:06Z","timestamp":1790702166604,"version":"4.1.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"11","license":[{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000146","name":"Alberta Innovates Technology Futures","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000146","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2017,10,24]]},"abstract":"<jats:p>\n            Poker is a family of games that exhibit imperfect information, where players do not have full knowledge of past events. While many perfect information games have been solved (e.g., Connect-Four and checkers), no nontrivial imperfect information game played competitively by humans has previously been solved. In this paper, we announce that the smallest variant of poker in-play, heads-up limit Texas hold'em, is now essentially weakly solved. Furthermore, this computation formally proves the common wisdom that the dealer in the game holds a significant advantage. This result was enabled by a new algorithm, CFR\n            <jats:sup>+<\/jats:sup>\n            , which is capable of solving extensive-form games three orders of magnitude larger than previously possible. This paper is an extended version of the original 2015\n            <jats:italic>Science<\/jats:italic>\n            article, with additional results showing Cepheus' in-game performance against computer and human opponents.\n          <\/jats:p>","DOI":"10.1145\/3131284","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T14:19:33Z","timestamp":1509027573000},"page":"81-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Heads-up limit hold'em poker is solved"],"prefix":"10.1145","volume":"60","author":[{"given":"Michael","family":"Bowling","sequence":"first","affiliation":[{"name":"University of Alberta, Edmonton, Alberta, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil","family":"Burch","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, Alberta, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Johanson","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, Alberta, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oskari","family":"Tammelin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,10,24]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Poker: A big deal. The Economist. Economist Newspaper Ltd. London. December 22 31--38 2007.  Poker: A big deal. The Economist. Economist Newspaper Ltd. London. December 22 31--38 2007."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Allis V.L. A Knowledge-Based Approach to Connect-Four. The Game is Solved: White Wins. Master's thesis Vrije Universiteit Amsterdam The Netherlands 1988.  Allis V.L. A Knowledge-Based Approach to Connect-Four. The Game is Solved: White Wins. Master's thesis Vrije Universiteit Amsterdam The Netherlands 1988.","DOI":"10.3233\/ICG-1988-11410"},{"key":"e_1_2_1_3_1","volume-title":"Vrije Universiteit Amsterdam","author":"Allis V.L.","year":"1994"},{"key":"e_1_2_1_4_1","volume-title":"London","author":"Babbage C.","year":"1864"},{"key":"e_1_2_1_5_1","volume-title":"IJCAI","author":"Billings D.","year":"2003"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00130-8"},{"key":"e_1_2_1_7_1","volume-title":"Gauthier-Villars","author":"Borel E.","year":"1938"},{"key":"e_1_2_1_8_1","unstructured":"Bowling M. Burch N. Johanson M. Tammelin O. The cepheus website 2015. http:\/\/poker.srv.ualberta.ca.  Bowling M. Burch N. Johanson M. Tammelin O. The cepheus website 2015. http:\/\/poker.srv.ualberta.ca."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1259433"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Bowling M. Burch N. Johanson M. Tammelin O. Heads-up limit hold'em poker is solved: Supplementary online material January 2015.  Bowling M. Burch N. Johanson M. Tammelin O. Heads-up limit hold'em poker is solved: Supplementary online material January 2015.","DOI":"10.1126\/science.1259433"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390166"},{"key":"e_1_2_1_12_1","volume-title":"Documentary","author":"Bronowski J.","year":"1973"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35706-5_23"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00129-1"},{"key":"e_1_2_1_15_1","volume-title":"Adv. Neural Inf. Process. Syst. (NIPS) 25, (2012), 2078","author":"Chen","year":"2086"},{"key":"e_1_2_1_16_1","volume-title":"Grand Central Publishing","author":"Craig M.","year":"2006"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2184356"},{"key":"e_1_2_1_18_1","volume-title":"WINE","author":"Gilpin A.","year":"2007"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284324"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 2012 Computer Poker Symposium.","author":"Jackson E.","year":"2012"},{"key":"e_1_2_1_21_1","volume-title":"AAAI","author":"Johanson M.","year":"2012"},{"key":"e_1_2_1_22_1","unstructured":"Johanson M. Bard N. Lanctot M. Gibson R. Bowling M. Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization. AAMAS (2012).   Johanson M. Bard N. Lanctot M. Gibson R. Bowling M. Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization. AAMAS (2012)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283396.2283441"},{"key":"e_1_2_1_24_1","volume-title":"Edmonton","author":"Johanson M.B.","year":"2016"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8256(92)90035-Q"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0051"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00023-4"},{"key":"e_1_2_1_29_1","series-title":"Annals of mathematics studies","volume-title":"Contributions to the Theory of Games","author":"Kuhn H.","year":"1950"},{"key":"e_1_2_1_30_1","volume-title":"Duke University Press","author":"Mirowski P.","year":"1992"},{"key":"e_1_2_1_31_1","unstructured":"Morgenstern O. The cold war is cold poker. N. Y. Times Mag. (Feb. 5 1961) pages 21--22.  Morgenstern O. The cold war is cold poker. N. Y. Times Mag. (Feb. 5 1961) pages 21--22."},{"key":"e_1_2_1_32_1","volume-title":"Contributions to the","author":"Nash J.F.","year":"1950"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403422285"},{"key":"e_1_2_1_34_1","first-page":"12","article-title":"The adventures of polaris the poker-playing robot","volume":"16","author":"Rehmeyer J.","year":"2008","journal-title":"Wired"},{"key":"e_1_2_1_35_1","first-page":"678","article-title":"Reduction of a game with complete memory to a matrix game","volume":"3","author":"Romanovskii I.V","year":"1962","journal-title":"Soviet Mathematics"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.12.005"},{"key":"e_1_2_1_37_1","first-page":"4","article-title":"The state of solving large incomplete-information games, and application to poker","volume":"31","author":"Sandholm T","year":"2010","journal-title":"AI Mag."},{"key":"e_1_2_1_38_1","first-page":"1","article-title":"Chinook the world man-machine checkers champion","volume":"17","author":"Schaeffer J.","year":"1996","journal-title":"AI Mag."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1144079"},{"key":"e_1_2_1_40_1","first-page":"41","article-title":"Programming a computer for playing chess","volume":"7","author":"Shannon C.E","year":"1950","journal-title":"Philosophical Magazine, Series"},{"key":"e_1_2_1_41_1","volume-title":"Comp. Games","author":"Shi J.","year":"2000"},{"key":"e_1_2_1_42_1","volume-title":"UAI","author":"Southey F.","year":"2005"},{"key":"e_1_2_1_43_1","volume-title":"Lessons Learned","author":"Tambe M.","year":"2011"},{"key":"e_1_2_1_44_1","unstructured":"Tammelin O. Cfr+. CoRR abs\/1407.5042 2014.  Tammelin O. Cfr+. CoRR abs\/1407.5042 2014."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832249.2832339"},{"key":"e_1_2_1_46_1","volume-title":"Pitman","author":"Turing A.","year":"1976"},{"key":"e_1_2_1_47_1","first-page":"1","article-title":"Zur theorie der gesellschaftsspiele","volume":"100","author":"von Neumann J","year":"1928","journal-title":"Mathematische Annalen"},{"key":"e_1_2_1_48_1","unstructured":"von Neumann J. Morgenstern O. Theory of Games and Economic Behavior. Princeton University Press Princeton Second Edition 1947.  von Neumann J. Morgenstern O. Theory of Games and Economic Behavior. Princeton University Press Princeton Second Edition 1947."},{"key":"e_1_2_1_49_1","volume-title":"AAAI Workshop on Computer Poker and Imperfect Information","author":"Waugh K.","year":"2015"},{"key":"e_1_2_1_50_1","volume-title":"Advances in Neural Information Processing Systems 22 (NIPS-09)","author":"Waugh K.","year":"2009"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the Fifth International Congress Mathematics","author":"Zermelo E.","year":"1913"},{"key":"e_1_2_1_52_1","unstructured":"Zinkevich M. Johanson M. Bowling M. Piccione C. Regret minimization in games with incomplete information. NIPS (2008) 905--912.   Zinkevich M. Johanson M. Bowling M. Piccione C. Regret minimization in games with incomplete information. NIPS (2008) 905--912."},{"key":"e_1_2_1_53_1","article-title":"The AAAI computer poker competition","volume":"29","author":"Zinkevich M.","year":"2006","journal-title":"J. Inter. Comp. Games Association"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3131284","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3131284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:35Z","timestamp":1750217435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3131284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,24]]},"references-count":53,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2017,10,24]]}},"alternative-id":["10.1145\/3131284"],"URL":"https:\/\/doi.org\/10.1145\/3131284","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,24]]},"assertion":[{"value":"2017-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}