Abstract
The development of competitive artificial Poker players is a challenge toArtificial Intelligence (AI) because the agent must deal with unreliable information and deception which make it essential to model the opponents to achieve good results. In this paper we propose the creation of an artificial Poker player through the analysis of past games between human players, with money involved. To accomplish this goal, we defined a classification problem that associates a given game state with the action that was performed by the player. To validate and test the defined player model, an agent that follows the learned tactic was created. The agent approximately follows the tactics from the human players, thus validating this model. However, this approach alone is insufficient to create a competitive agent, as generated strategies are static, meaning that they can’t adapt to different situations. To solve this problem, we created an agent that uses a strategy that combines several tactics from different players.By using the combined strategy, the agentgreatly improved its performance against adversaries capable of modeling opponents.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hsu, F.-H.: Behind Deep Blue: Building the Computer that Defeated the World Chess Champion. Princeton University Press, Princeton (2002)
Billings, D., Papp, D., Schaeffer, J., Szafron, D.: Opponent modeling in poker. In: AAAI 1998/IAAI 1998, pp. 493–499. American Association for Artificial Intelligence, Madison (1998)
Davidson, A.: Opponent modeling in poker. M.Sc., University of Alberta, Edmonton, Alberta, Canada (2002)
Sklansky, D.: The Theory of Poker: A Professional Poker Player Teaches You How to Think Like One. Two Plus Two (2002)
Computer Poker Research Group Homepage, http://webdocs.cs.ualberta.ca/~games/poker/
Billigs, D.: Algorithms and Assessment in Computer Poker. Ph.D., University of Alberta, Edmonton, Alberta (2006)
Gilpin, A., Sandholm, T.: Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker. In: 6th international joint conference on Autonomous agents and multiagent systems, Honolulu, Hawaii, pp. 1–8. ACM, New York (2007)
Miltersen, P.B., Sørensen, T.B.: A near-optimal strategy for a heads-up no-limit Texas Hold’em poker tournament. In: 6th international joint conference on Autonomous agents and multiagent systems, Honolulu, Hawaii, pp. 1–8. ACM, New York (2007)
Johanson, M., Bowling, M.: Data Biased Robust Counter Strategies. In: Twelfth International Conference on Artificial Intelligence and Statistics, Clearwater Beach, Florida, USA, April 16-18, pp. 264–271 (2009)
Beattie, B., Nicolai, G., Gerhard, D., Hilderman, R.J.: Pattern Classification in No-Limit Poker: A Head-Start Evolutionary Approach. In: 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, Montreal, Quebec, Canada, pp. 204–215. Springer, Heidelberg (2007)
Felix, D., Reis, L.P.: An Experimental Approach to Online Opponent Modeling in Texas Hold’em Poker. In: 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence, Savador, Brazil, pp. 83–92. Springer, Heidelberg (2008)
Poker Bot Artificial Intelligence Resources, http://spaz.ca/poker/
Chen, B., Ankenman, J.: The Mathematics of Poker. Conjelco (2006)
Félix, D., Reis, L.P.: Opponent Modelling in Texas Hold’em Poker as the Key for Success. In: ECAI 2008: 18th European Conference on Artificial Intelligence, pp. 893–894. IOS Press, Amsterdam (2008)
MeerkatOpentestbed, http://code.google.com/p/opentestbed/
Out Floppe Poker Q & A: Obfuscated datamined hand histories, http://www.outflopped.com/questions/286/obfuscated-datamined-hand-histories
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. SIGKDD ExplorNewsl. 11(1), 10–18 (2009)
Broeck, G., Driessen, K., Ramon, J.: Monte-Carlo Tree Search in Poker Using Expected Reward Distributions. In: 1st Asian Conference on Machine Learning: Advances in Machine Learning, Nanjing, China, pp. 367–381 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Teófilo, L.F., Reis, L.P. (2011). Building a No Limit Texas Hold’em Poker Agent Based on Game Logs Using Supervised Learning. In: Kamel, M., Karray, F., Gueaieb, W., Khamis, A. (eds) Autonomous and Intelligent Systems. AIS 2011. Lecture Notes in Computer Science(), vol 6752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21538-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-21538-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21537-7
Online ISBN: 978-3-642-21538-4
eBook Packages: Computer ScienceComputer Science (R0)