Abstract
Influenced by the possibilities of the Internet poker has become a popular online game. Spurred by this development, automated poker got into the focus of research in game theory (GT), artificial intelligence (AI) and multi-agent systems (MAS). This paper describes the development and evaluation of PLICAS, a poker bot designed for the ‘Texas Hold’em Fixed Limit Heads-up’ variant. The poker bot integrates approaches, such as opponent modeling, abstraction techniques, and case-based reasoning. PLICAS also introduces simulation-based methods for the exploitation of the opponent’s play. Participation in the 2010 AAAI Computer Poker Competition (ACPC) shows that PLICAS has a lot of potential but suffers from a vulnerable opponent modeling strategy.
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
Billings, D., Burch, N., Davidson, A., Holte, R., Schauenberg, T., Schaeffer, J., Szafron, D.: Approximating game-theoretic optimal strategies for full-scale poker. In: Proc. of the Int. Joint Conf. on Artificial Intelligence (ICAI 2003), Las Vegas, NV, pp. 661–668 (2003)
Billings, D., Papp, D., Schaeffer, J., Szafron, D.: Opponent modeling in poker. In: Proc. of the Fifteenth Nat. Conf. on Artificial Intelligence (AAAI 1998), Madison, WI, pp. 493–499. AAAI Press (1998)
Billings, D., Pena, L., Schaeffer, J., Szafron, D.: Using probabilistic knowledge and simulation to play poker. In: Proc. of the Sixteenth Nat. Conf. on Artificial Intelligence (AAAI 1999), Orlando, FL, pp. 697–703 (1999)
Davidson, A.: Using artificial neural networks to model opponents in texas hold’em. Res. Proj. Review CMPUT 499, Poker Res. Group, Univ. of Alberta, CA (1999)
Davidson, A., Billings, D., Schaeffer, J., Szafron, D.: Improved opponent modeling in poker. In: Proceedings of the Int. Conf. on Artificial Intelligence (ICAI 2000), Las Vegas, Nevada, pp. 493–499 (2000)
Gilpin, A., Sorensen, T.B., Sandholm, T.: Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of texas hold’em poker. In: Proc. of the Nat. Conf. on Artificial Intelligence (AAAI 2007), Vancouver, CA (2007)
Hamilton, S., Garber, L.: Deep blue’s hardware-software synergy. Computer 30, 29–35 (1997)
Johanson, M.: Robust strategies and counter-strategies: Building a champion level computer poker player. Master’s thesis, University of Alberta (2007)
Koller, D., Pfeffer, A.: Representations and solutions for game-theoretic problems. Artificial Intelligence 94, 167–215 (1997)
Kuhn, H.W.: Simplified two-person poker. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, vol. 1, pp. 97–103. Princeton University Press (1950)
Lockett, A., Miikkulainen, R.: Evolving opponent models for texas hold’em. In: Proc. of the 2008 IEEE Conf. on Computational Intelligence in Games, Perth. IEEE (2008)
Nash, J.F., Shapley, L.S.: A simple 3-person poker game. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, vol. 1, pp. 105–116. Princeton University Press (1950)
Neumann, J.V., Morgenstern, O.: Theory of Games and Economic Behavior. John Wiley (1944)
Rubin, J., Watson, I.: A Memory-Based Approach to Two-Player Texas Hold’em. In: Nicholson, A., Li, X. (eds.) AI 2009. LNCS, vol. 5866, pp. 465–474. Springer, Heidelberg (2009)
Rubin, J., Watson, I.: Similarity-Based Retrieval and Solution Re-use Policies in the Game of Texas Hold’em. In: Bichindaritz, I., Montani, S. (eds.) ICCBR 2010. LNCS, vol. 6176, pp. 465–479. Springer, Heidelberg (2010)
Schaeffer, J.: One jump ahead: challenging human supremacy in checkers. Springer, NY (1997)
Schauenberg, T.: Opponent modeling and search in poker. Master’s thesis, University of Alberta, Department of Computing Science, Edmonton, Alberta (2006)
Sklansky, D.: Hold’em Poker: A Complete Guide to Playing the Game. Two Plus Two Publishing, Henderson, NV, USA (1997)
Southey, F., Bowling, M., Larson, B., Piccione, C., Burch, N., Billings, D., Rayner, C.: Bayes’ bluff: Opponent modeling in poker. In: Proc. of the Twenty-First Conf. on Uncertainty in Artificial Intelligence (UAI), pp. 550–558 (2005)
Watson, I., Rubin, J.: CASPER: A Case-Based Poker-Bot. In: Wobcke, W., Zhang, M. (eds.) AI 2008. LNCS (LNAI), vol. 5360, pp. 594–600. Springer, Heidelberg (2008)
Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Advances in Neural Information Processing Systems 20 (NIPS), pp. 1729–1736 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwind, M., Friedrich, C. (2012). Automating Texas Hold’em Poker with PLICAS . In: Zhang, R., Zhang, J., Zhang, Z., Filipe, J., Cordeiro, J. (eds) Enterprise Information Systems. ICEIS 2011. Lecture Notes in Business Information Processing, vol 102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29958-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-29958-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29957-5
Online ISBN: 978-3-642-29958-2
eBook Packages: Computer ScienceComputer Science (R0)