Heads-up limit hold’em poker is solved

  title={Heads-up limit hold’em poker is solved},
  author={Michael Bowling and Neil Burch and Michael Bradley Johanson and Oskari Tammelin},
  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… 

Solving Heads-Up Limit Texas Hold'em

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.

Solving imperfect-information games

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.

DeepStack: Expert-level artificial intelligence in heads-up no-limit poker

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.

Libratus: The Superhuman AI for No-Limit Poker

This work presents Libratus, the first--and so far only--AI to defeat top human professionals in Heads-up no-limit Texas Hold'em.

Generating Novice Heuristics for Post-Flop Poker

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.

AI surpasses humans at six-player poker

A new computer player called Pluribus exceeds human performance for six-player Texas hold'em poker, and may lead to algorithms with wider applicability.

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 different

A simulation study of Texas hold 'em poker: what Taylor Swift understands and James Bond doesn't

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.

Depth-Limited Solving for Imperfect-Information Games

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.

Superhuman AI for heads-up no-limit poker: Libratus beats top professionals

Libratus, an AI that, in a 120,000-hand competition, defeated four top human specialist professionals in heads-up no-limit Texas hold’em, the leading benchmark and long-standing challenge problem in imperfect-information game solving is presented.



Solving Heads-Up Limit Texas Hold'em

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.

Checkers Is Solved

This paper announces that checkers is now solved: Perfect play by both sides leads to a draw.

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 practical

Robust Strategies and Counter-Strategies: From Superhuman to Optimal Play

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.

A Knowledge-Based Approach of Connect-Four

  • L. Allis
  • Computer Science
    J. Int. Comput. Games Assoc.
  • 1988
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.

Computer poker: A review

Approximating Game-Theoretic Optimal Strategies for Full-scale Poker

The computation of the first complete approximations of game-theoretic optimal strategies for full-scale poker is addressed, and linear programming solutions to the abstracted game are used to create substantially improved poker-playing programs.

Bayes? Bluff: Opponent Modelling in Poker

This paper presents a Bayesian probabilistic model for a broad class of poker games, separating the uncertainty in the game dynamics from the uncertainty of the opponent's strategy.

CHINOOK: The World Man-Machine Checkers Champion

This article reports on the progress of the checkers (8 3 8 draughts) program CHINOOK since 1992, which is the first time in history that a computer has won a human-world championship.