Not Logged In

Headsup limit hold’em poker is solved

Poker is a family of games that exhibit imperfect information, where players do not have full knowledge of past events. Whereas 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. Here, we announce that 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 substantial advantage. This result was enabled by a new algorithm, CFR+, which is capable of solving extensive-form games orders of magnitude larger than previously possible.

Citation

M. Bowling, N. Burch, M. Johanson, O. Tammelin. "Headsup limit hold’em poker is solved". Science, 347(6218), pp 145-149, January 2015.

Keywords:  
Category: In Journal
Web Links: Science

BibTeX

@article{Bowling+al:15,
  author = {Michael Bowling and Neil Burch and Michael Johanson and Oskari
    Tammelin},
  title = {Headsup limit hold’em poker is solved},
  Volume = "347",
  Number = "6218",
  Pages = {145-149},
  journal = {Science},
  year = 2015,
}

Last Updated: July 13, 2020
Submitted by Sabina P

University of Alberta Logo AICML Logo