Skip to main content

Poker as a testbed for AI research

  • Posters
  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1418))

Abstract

For years, games researchers have used chess, checkers and other board games as a testbed for artificial intelligence research. The success of world-championship-caliber programs for these games has resulted in a number of interesting games being overlooked. Specifically, we show that poker can serve as an interesting testbed for machine intelligence research related to decision making problems. Poker is a game of imperfect knowledge, where multiple competing agents must deal with risk management, agent modeling, unreliable information and deception, much like decision-making applications in the real world. The heuristic search and evaluation methods successfully employed in chess are not helpful here. This paper outlines the difficulty of playing strong poker, and describes our first steps towards building a world-class poker-playing program.

This research is supported by the Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, 1944.

    Google Scholar 

  2. N. Ankeny, Poker Strategy: Winning with Game Theory, Basic Books, Inc., 1981.

    Google Scholar 

  3. M. Sakaguchi and S. Sakai, Solutions of Some Three-person Stud and Draw Poker, Mathematics Japonica 37, 6 (1992), 1147–1160.

    Google Scholar 

  4. D. Sklansky and M. Malmuth, Hold'em Poker for Advanced Players, Two Plus Two Publishing, 1994.

    Google Scholar 

  5. N. Findler, Studies in Machine Cognition Using the Game of Poker, Communications of the ACM 20, 4 (1977), 230–245.

    Article  Google Scholar 

  6. D. Billings, Computer Poker, M.Sc. thesis, Dept. of Computing Science, University of Alberta, 1995.

    Google Scholar 

  7. D. Koller and A. Pfeffer, Representations and Solutions for Game-Theoretic Problems, Artificial Intelligence 94, 1–2 (1997), 167–215.

    Article  Google Scholar 

  8. D. Carmel and S. Markovitch, Incorporating Opponent Models into Adversary Search, AAAI, 19969, 120–125.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Robert E. Mercer Eric Neufeld

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Billings, D., Papp, D., Schaeffer, J., Szafron, D. (1998). Poker as a testbed for AI research. In: Mercer, R.E., Neufeld, E. (eds) Advances in Artificial Intelligence. Canadian AI 1998. Lecture Notes in Computer Science, vol 1418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64575-6_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-64575-6_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64575-7

  • Online ISBN: 978-3-540-69349-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics