Abstract
Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold’em. The transition from a limit betting structure to a no limit betting structure offers challenging problems that are not faced in the limit domain. In particular, we address the problems of determining a suitable action abstraction and the resulting state translation that is required to map real-value bet amounts into a discrete set of abstract actions. We also detail the similarity metrics used in order to identify similar scenarios, without which no generalisation of playing decisions would be possible. We show that we were able to successfully generalise no limit betting decisions from recorded data via our agent, SartreNL, which achieved a 2nd place finish at the 2010 Annual Computer Poker Competition.
This is a preview of subscription content, log in via an institution to check access.
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
Bowling, M., Risk, N.A., Bard, N., Billings, D., Burch, N., Davidson, J., Hawkin, J., Holte, R., Johanson, M., Kan, M., Paradis, B., Schaeffer, J., Schnizlein, D., Szafron, D., Waugh, K., Zinkevich, M.: A demonstration of the Polaris poker system. In: AAMAS 2009: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, Richland, SC, pp. 1391–1392. International Foundation for Autonomous Agents and Multiagent Systems (2009)
Sandholm, T.: The State of Solving Large Incomplete-Information Games, and Application to Poker. AI Magazine (Winter 2010)
Rubin, J., Watson, I.: Computer poker: A review. Artificial Intelligence 145(5-6), 958–987 (2011)
Schnizlein, D., Bowling, M.H., Szafron, D.: Probabilistic State Translation in Extensive Games with Large Action Sets. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, pp. 278–284 (2009)
Van den Broeck, G., Driessens, K., Ramon, J.: Monte-Carlo Tree Search in Poker Using Expected Reward Distributions. In: Zhou, Z.-H., Washio, T. (eds.) ACML 2009. LNCS, vol. 5828, pp. 367–381. Springer, Heidelberg (2009)
Gilpin, A., Sandholm, T., Sørensen, T.B.: A heads-up no-limit Texas Hold’em poker player: discretized betting models and automatically generated equilibrium-finding programs. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 911–918 (2008)
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)
ACPC. The Annual Computer Poker Competition (2011), http://www.computerpokercompetition.org/
Andersson, R.: Pseudo-Optimal Strategies in No-Limit Poker. Master’s thesis, Umea University (2006)
Billings, D., Burch, N., Davidson, A., Holte, R.C., Schaeffer, J., Schauenberg, T., Szafron, D.: Approximating Game-Theoretic Optimal Strategies for Full-scale Poker. In: IJCAI 2003, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 661–668 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rubin, J., Watson, I. (2011). Successful Performance via Decision Generalisation in No Limit Texas Hold’em. In: Ram, A., Wiratunga, N. (eds) Case-Based Reasoning Research and Development. ICCBR 2011. Lecture Notes in Computer Science(), vol 6880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23291-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-23291-6_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23290-9
Online ISBN: 978-3-642-23291-6
eBook Packages: Computer ScienceComputer Science (R0)