Carnegie Mellon University
file.pdf (54.79 kB)

A Texas Hold’em Poker Player Based on Automated Abstraction and Real-time Equilibrium Computation

Download (54.79 kB)
journal contribution
posted on 2004-03-01, 00:00 authored by Andrew Gilpin, Tuomas W Sandholm

We demonstrate our game theory-based Texas Hold’em poker player. To overcome the computational difficulties stemming from Texas Hold’em’s gigantic game tree, our player uses automated abstraction and real-time equilibrium approximation. Our player solves the first two rounds of the game in a large off-line computation, and solves the last two rounds in a real-time equilibrium approximation. Participants in the demonstration will be able to compete against our opponent and experience first-hand the cognitive abilities of our player. Some of the techniques used by our player, which does not directly incorporate any poker-specific expert knowledge, include such poker techniques as bluffing, slow-playing, check-raising, and semi-bluffing, all techniques normally associated with human play.




Usage metrics