Optimal Rhode Island Hold'em poker

Authors:
Andrew Gilpin;Tuomas Sandholm
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
Year:
2005

Citing 4
Cited 6

Fast algorithms for finding randomized strategies in game trees

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Representations and solutions for game-theoretic problems

Artificial Intelligence - Special issue on economic principles of multi-agent systems
The challenge of poker

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Approximating game-theoretic optimal strategies for full-scale poker

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Finding equilibria in large sequential games of imperfect information

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Lossless abstraction of imperfect information games

Journal of the ACM (JACM)
A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
Effective short-term opponent exploitation in simplified poker

Machine Learning
Approximation guarantees for fictitious play

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rhode Island Hold'em is a poker card game that has been proposed as a testbed for AI research. This game, with a tree size larger than 3.1 billion nodes, features many characteristics present in full-scale poker (e.g., Texas Hold'em). Our research advances in equilibrium computation have enabled us to solve for the optimal (equilibrium) strategies for this game. Some features of the equilibrium include poker techniques such as bluffing, slow-playing, check-raising, and semi-bluffing. In this demonstration, participants will compete with our optimal opponent and will experience these strategies firsthand.