PLICAS - A Texas Hold'em Poker Bot

Christian Friedrich, Michael Schwind

Abstract

Since two decades, poker is a very popular game and in the last decade poker became also an interesting topic in game theory (GT), artificial intelligence (AI) and multi-agent systems (MAS). This paper describes the development and evaluation of the poker bot PLICAS designed for the variant ‘Texas Hold’em Fixed Limit Heads-up’. In the development process, approaches such as opponent modeling, abstraction techniques, and case-based reasoning were studied and implemented. PLICAS also introduces simulation-based methods for the exploitation of the opponent’s play. In the experimental part of this paper, we analyze the strengths and weaknesses of PLICAS, which participated in the 2010 AAAI Computer Poker Competition (ACPC).

References

  1. Billings, D., Burch, N., Davidson, A., Holte, R., Schauenberg, T., Schaeffer, J., and Szafron, D. (2003). Approximating game-theoretic optimal strategies for full-scale poker. In Proceedings of the International Joint Conference on Artificial Intelligence (ICAI'03), Las Vegas, Nevada, pages 661-668.
  2. Billings, D., Papp, D., Schaeffer, J., and Szafron, D. (1998). Opponent modeling in poker. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), Madison, WI, pages 493-499. AAAI Press.
  3. Billings, D., Pena, L., Schaeffer, J., and Szafron, D. (1999). Using probabilistic knowledge and simulation to play poker. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), Orlando, Florida, pages 697-703.
  4. Davidson, A. (1999). Using artificial neural networks to model opponents in texas hold'em. Res. Project Review CMPUT 499, Poker Res. Group, Univ. of Alberta, CA.
  5. Davidson, A., Billings, D., Schaeffer, J., and Szafron, D. (2000). Improved opponent modeling in poker. In Proceedings of the International Conference on Artificial Intelligence (ICAI'00), Las Vegas, Nevada, pages 493-499.
  6. Gilpin, A., Sorensen, T. B., and Sandholm, T. (2007). Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of texas hold'em poker. In Proceedings of the National Conference on Artificial Intelligence (AAAI 2007) Vancouver, Canada.
  7. Hamilton, S. and Garber, L. (1997). Deep blue's hardwaresoftware synergy. Computer, 30:29-35.
  8. Johanson, M. (2007). Robust strategies and counterstrategies: Building a champion level computer poker player. Master's thesis, University of Alberta.
  9. Koller, D. and Pfeffer, A. (1997). Representations and solutions for game-theoretic problems. Artificial Intelligence, 94:167-215.
  10. Kuhn, H. W. (1950). Simplified two-person poker. In Kuhn, H. W. and Tucker, A. W., editors, Contributions to the Theory of Games, volume 1, pages 97-103. Princeton University Press.
  11. Lockett, A. and Miikkulainen, R. (2008). Evolving opponent models for texas hold'em. In Proceedings of the 2008 IEEE Conference on Computational Intelligence in Games. Perth, 2008. IEEE.
  12. Nash, J. F. and Shapley, L. S. (1950). A simple 3-person poker game. In Kuhn, H. W. and Tucker, A. W., editors, Contributions to the Theory of Games, volume 1, pages 105-116. Princeton University Press.
  13. Neumann, J. V. and Morgenstern, O. (1944). Theory of Games and Economic Behavior. John Wiley.
  14. Rubin, J. and Watson, I. (2009). A memory-based approach to two-player texas hold'em. In Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence AI'09, Melbourne, Australia, pages 465-474. Springer.
  15. Rubin, J. and Watson, I. (2010). Similarity-based retrieval and solution re-use policies in the game of texas hold'em. In Proc. of the 18th Int. Conference on Case-based Reasoning, ICCBR 2010, Alessandria, Italy, pages 465-479.
  16. Schaeffer, J. (1997). One jump ahead: challenging human supremacy in checkers. Springer, NY, USA.
  17. Schauenberg, T. (2006). Opponent modeling and search in poker. Master's thesis, University of Alberta, Department of Computing Science, Edmonton, Alberta.
  18. Sklansky, D. (1997). Hold'em Poker: A Complete Guide to Playing the Game. Two Plus Two Publishing, Henderson, NV, USA.
  19. Southey, F., Bowling, M., Larson, B., Piccione, C., Burch, N., Billings, D., and Rayner, C. (2005). Bayes' bluff: Opponent modelling in poker. In Proceedings of the Twenty-First Conference on Uncertaintyin Artificial Intelligence (UAI), pages 550-558.
  20. Watson, I. and Rubin, J. (2008). Casper: a case-based poker-bot. In Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence AI'08, Auckland, New Zealand, volume 5360 of Lecture Notes in Computer Science, pages 594-600. Springer.
  21. Zinkevich, M., Johanson, M., Bowling, M., and Piccione, C. (2008). Regret minimization in games with incomplete information. In Advances in Neural Information Processing Systems 20 (NIPS), pages 1729-1736.
Download


Paper Citation


in Harvard Style

Friedrich C. and Schwind M. (2011). PLICAS - A Texas Hold'em Poker Bot . In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8425-54-6, pages 63-72. DOI: 10.5220/0003465300630072


in Bibtex Style

@conference{iceis11,
author={Christian Friedrich and Michael Schwind},
title={PLICAS - A Texas Hold'em Poker Bot},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2011},
pages={63-72},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003465300630072},
isbn={978-989-8425-54-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - PLICAS - A Texas Hold'em Poker Bot
SN - 978-989-8425-54-6
AU - Friedrich C.
AU - Schwind M.
PY - 2011
SP - 63
EP - 72
DO - 10.5220/0003465300630072