Date of Original Version



Conference Proceeding

Abstract or Description

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.



Published In

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), Demonstration Track..