Developing computer programs that play Poker at human level is considered to be challenge to the A.I. research community, due to its incomplete information and stochastic nature. Due to these characteristics of the game, a competitive agent must manage luck and use opponent modeling to be successful at short term and therefore be profitable. In this paper we propose the creation of No Limit Hold'em Poker agents by copying strategies of the best human players, by analyzing past games between them. To accomplish this goal, first we determine the best players on a set of game logs by determining which ones have higher winning expectation. Next, we define a classification problem to represent the player strategy, by associating a game state with the performed action. To validate and test the defined player model, the HoldemML framework was created. This framework generates agents by classifying the data present on the game logs with the goal to copy the best human player tactics. The created agents approximately follow the tactics from the counterpart human player, thus validating the defined player model. However, this approach proved to be insufficient to create a competitive agent, since the generated strategies were static, which means that they are easy prey to opponents that can perform opponent modeling. This issue can be solved by combining multiple tactics from different players. This way, the agent switches the tactic from time to time, using a simple heuristic, in order to confuse the opponent modeling mechanisms.
[1]
Jonathan Schaeffer,et al.
Opponent Modeling in Poker
,
1998,
AAAI/IAAI.
[2]
Bill Chen,et al.
The Mathematics of Poker
,
2006
.
[3]
Dinis Félix,et al.
Opponent Modelling in Texas Hold'em Poker as the Key for Success
,
2008,
ECAI.
[4]
Peter Bro Miltersen,et al.
A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament
,
2007,
AAMAS '07.
[5]
David Gerhard,et al.
Pattern Classification in No-Limit Poker: A Head-Start Evolutionary Approach
,
2007,
Canadian Conference on AI.
[6]
Ian H. Witten,et al.
The WEKA data mining software: an update
,
2009,
SKDD.
[7]
Darse Billings.
Algorithms and assessment in computer poker
,
2006
.
[8]
Guy Van den Broeck,et al.
Monte-Carlo Tree Search in Poker Using Expected Reward Distributions
,
2009,
ACML.
[9]
Tuomas Sandholm,et al.
Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker
,
2007,
AAMAS '07.
[10]
Dinis Félix,et al.
An Experimental Approach to Online Opponent Modeling in Texas Hold'em Poker
,
2008,
SBIA.
[11]
Feng-Hsiung Hsu,et al.
Behind Deep Blue: Building the Computer that Defeated the World Chess Champion
,
2002
.
[12]
Michael H. Bowling,et al.
Data Biased Robust Counter Strategies
,
2009,
AISTATS.