Heads-up limit hold’em poker is solved

@article{Bowling2015HeadsupLH,
  title={Heads-up limit hold’em poker is solved},
  author={Michael Bowling and Neil Burch and Michael Bradley Johanson and Oskari Tammelin},
  journal={Science},
  year={2015},
  volume={347},
  pages={145 - 149}
}
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… Expand
Solving Heads-Up Limit Texas Hold'em
TLDR
The engineering details required to make Cepheus solve heads-up limit Texas hold'em poker are described in detail and the theoretical soundness of CFR+ and its component algorithm, regret-matching + is proved. Expand
Solving imperfect-information games
TLDR
A strategy for two-player limit Texas Hold'em poker is computed that is so close to optimal that, at the pace a human plays poker, it cannot be beaten with statistical significance in a lifetime. Expand
DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
TLDR
DeepStack is introduced, an algorithm for imperfect-information settings that combines recursive reasoning to handle information asymmetry, decomposition to focus computation on the relevant decision, and a form of intuition that is automatically learned from self-play using deep learning. Expand
Superhuman AI for multiplayer poker
TLDR
Pluribus, an AI that is stronger than top human professionals in six-player no-limit Texas hold’em poker, the most popular form of poker played by humans, is presented. Expand
Libratus: The Superhuman AI for No-Limit Poker
TLDR
This work presents Libratus, the first--and so far only--AI to defeat top human professionals in Heads-up no-limit Texas Hold'em. Expand
Generating Novice Heuristics for Post-Flop Poker
TLDR
This work addresses the problem of learning chains of human-learnable heuristics for playing heads-up limit Texas Hold’em, focusing on the post-flop stages of the game. Expand
AI surpasses humans at six-player poker
TLDR
A new computer player called Pluribus exceeds human performance for six-player Texas hold'em poker, and may lead to algorithms with wider applicability. Expand
Is Poker a Skill Game? New Insights from Statistical Physics
During last years poker has gained a lot of prestige in several countries and, beyond to be one of the most famous card games, it represents a modern challenge for scientists belonging to differentExpand
A simulation study of Texas hold 'em poker: what Taylor Swift understands and James Bond doesn't
TLDR
In comparing the ideas expressed in Taylor Swift’s song, New Romantics, and the betting patterns employed by James Bond in the 2006 film, Casino Royale, it is concluded that Ms Swift demonstrates a greater understanding of the true probabilities of winning a game of Texas hold ’em poker. Expand
Depth-Limited Solving for Imperfect-Information Games
TLDR
A principled way to conduct depth-limited solving in imperfect-information games by allowing the opponent to choose among a number of strategies for the remainder of the game at the depth limit, which defeats two prior top agents using only a 4-core CPU and 16 GB of memory. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 122 REFERENCES
Solving Heads-Up Limit Texas Hold'em
TLDR
The engineering details required to make Cepheus solve heads-up limit Texas hold'em poker are described in detail and the theoretical soundness of CFR+ and its component algorithm, regret-matching + is proved. Expand
Checkers Is Solved
TLDR
This paper announces that checkers is now solved: Perfect play by both sides leads to a draw. Expand
The challenge of poker
TLDR
The design considerations and architecture of the poker program Poki are described, which is a program capable of playing reasonably strong poker, but there remains considerable research to be done to play at world-class level. Expand
Accelerating Best Response Calculation in Large Extensive Games
TLDR
This paper details a general technique for best response computations that can often avoid a full game tree traversal and applies this approach to computing the worst-case performance of a number of strategies in heads-up limit Texas hold'em, which, prior to this work, was not possible. Expand
AAAI-15 Workshop on Computer Poker and Imperfect Information
The AAAI Workshop on Computer Poker and Imperfect Information took place on January 26, 2015 in Austin, Texas. The workshop brought together researchers studying new theoretical and practicalExpand
Programming a computer for playing chess
This paper is concerned with the problem of constructing a computing routine or “program” for a modern general purpose computer which will enable it to play chess. Although perhaps of no practicalExpand
Robust Strategies and Counter-Strategies: From Superhuman to Optimal Play
TLDR
The papers presented in this thesis encompass the complete end-to-end task of creating strong agents for extremely large games by using the Abstraction-Solving-Translation procedure, and a body of research that has made contributions to each step of this task is presented. Expand
A Knowledge-Based Approach of Connect-Four
  • L. Allis
  • Computer Science
  • J. Int. Comput. Games Assoc.
  • 1988
TLDR
A Shannon C-type strategy program, VICTOR, is written for Connect-Four, based on nine strategic rules, which can be used by Black to at least draw the game, on each 7 × (2n) board, provided that White does not start at the middle column. Expand
Representations and Solutions for Game-Theoretic Problems
TLDR
The Gala system is described, an implemented system that allows the specification and efficient solution of large imperfect information games and provides a new declarative language for compactly and naturally representing games by their rules. Expand
Computer poker: A review
TLDR
This paper begins with the first serious attempts to create strong computerised poker players by constructing knowledge-based and simulation-based systems, followed by the use of computational game theory to construct robust poker agents and the advances that have been made in this area. Expand
...
1
2
3
4
5
...