Approximating Game-Theoretic Optimal Strategies for Full-scale Poker

The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represent the game of 2player Texas Hold’em, having size ¢¤£¦¥¨§©¨ , using closely related models each having size ¢¤£¦¥¨§¨ . Despite the reduction in size by a factor of 100 billion, the resulting models retain the key properties and structure of the real game. Linear prosolutions to the abstracted game are used to create substantially improved poker-playing programs, able to defeat strong human players and be competitive against world-class opponents.

• Type: Conference
• Year: 2003
• Where: IJCAI
• Authors: Darse Billings, Neil Burch, Aaron Davidson, Robert C. Holte, Jonathan Schaeffer, Terence Schauenberg, Duane Szafron
• Keywords: Game-theoretic Optimal Strategies, IJCAI 2003, IJCAI 2007, Several Abstraction Techniques, first Complete Approximations