Optimal Rhode Island Hold'em Poker

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.

[1]  B. Stengel,et al.  Efficient Computation of Behavior Strategies , 1996 .

[2]  Bernhard von Stengel,et al.  Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.

[3]  Jonathan Schaeffer,et al.  The challenge of poker , 2002, Artif. Intell..

[4]  Jonathan Schaeffer,et al.  Approximating Game-Theoretic Optimal Strategies for Full-scale Poker , 2003, IJCAI.

[5]  Michael L. Littman,et al.  Abstraction Methods for Game Theoretic Poker , 2000, Computers and Games.

[6]  D. Koller,et al.  Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .

[7]  P. Reny,et al.  On the Strategic Equivalence of Extensive Form Games , 1994 .

[8]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Avi Pfeffer,et al.  Representations and Solutions for Game-Theoretic Problems , 1997, Artif. Intell..

[10]  Tuomas Sandholm,et al.  Finding equilibria in large sequential games of imperfect information , 2006, EC '06.

[11]  H W Kuhn,et al.  Extensive Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.