Skip to main content

Pattern Classification in No-Limit Poker: A Head-Start Evolutionary Approach

  • Conference paper
Book cover Advances in Artificial Intelligence (Canadian AI 2007)

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

Abstract

We have constructed a poker classification system which makes informed betting decisions based upon three defining features extracted while playing poker: hand value, risk, and aggressiveness. The system is implemented as a player-agent, therefore the goals of the classifier are not only to correctly determine whether each hand should be folded, called, or raised, but to win as many chips as possible from the other players. The decision space is found by evolutionary methods, starting from a data-driven initial state. Our results showed that evolving an agent from a data-driven “head-start” position resulted in the best performance over agents evolved from scratch, data-driven agents, random agents, and “always fold” agents.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Billings, D., Davidson, A., Schaeffer, J., Szafron, D.: The challenge of poker. Artificial Intelligence 134(1-2), 201–240 (2002)

    Article  MATH  Google Scholar 

  2. Billings, D., Burch, N., Davidson, A., Holte, R., Schaeffer, J., Schauenberg, T., Szafron, D.: Approximating game theoretic optimal strategies for full-scale poker. In: International Joint Conference on Artificial Intelligence, August 2003, pp. 661–668 (2003)

    Google Scholar 

  3. Blank, T., Soh, L.K., Scott, S.: Creating an svm to play strong poker. In: International Conference on Machine Learning and Applications, December 2004, pp. 150–155 (2004)

    Google Scholar 

  4. Oliehoek, F.A., Vlassis, N., de Jong, E.D.: Coevolutionary nash in poker games. In: 17th Belgian-Dutch Conference on Artificial Intelligence, October 2005, pp. 188–193 (2005)

    Google Scholar 

  5. Southey, F., Bowling, M., Larson, B., Piccione, C., Burch, N., Billings, D., Rayner, C.: Bayes’ bluff: Opponent modelling in poker. In: Twenty-First Conference on Uncertainty in Artificial Intelligence, July 2005, pp. 550–558 (2005)

    Google Scholar 

  6. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley Interscience, Hoboken (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ziad Kobti Dan Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Beattie, B., Nicolai, G., Gerhard, D., Hilderman, R.J. (2007). Pattern Classification in No-Limit Poker: A Head-Start Evolutionary Approach. In: Kobti, Z., Wu, D. (eds) Advances in Artificial Intelligence. Canadian AI 2007. Lecture Notes in Computer Science(), vol 4509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72665-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72665-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-72665-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics