Abstract
In previous papers we have presented our autonomous poker playing agent (SARTRE) that uses a memory-based approach to create a betting strategy for two-player, limit Texas Hold’em. SARTRE participated in the 2009 IJCAI Computer Poker Competition where the system was thoroughly evaluated by challenging a range of other computerised opponents. Since the competition SARTRE has undergone case-based maintenance. In this paper we present results from the 2009 Computer Poker Competition and describe the latest modifications and improvements to the system. Specifically, we investigate two claims: the first that modifying the solution representation results in changes to the problem coverage and the second that different policies for re-using solutions leads to changes in performance. Three separate solution re-use policies for making betting decisions are introduced and evaluated. We conclude by presenting results of self-play experiments between the pre and post maintenance systems.
If you wish to challenge the latest version of SARTRE, you may do so at http://www.cs.auckland.ac.nz/poker/
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.
Similar content being viewed by others
References
Billings, D., Papp, D., Schaeffer, J., Szafron, D.: Poker as Testbed for AI Research. In: Mercer, R.E. (ed.) Canadian AI 1998. LNCS, vol. 1418, pp. 228–238. Springer, Heidelberg (1998)
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.: SARTRE: System Overview, A Case-Based Agent for Two-Player Texas Hold’em. In: Workshop on Case-Based Reasoning for Computer Games, Eighth International Conference on Case-Based Reasoning (ICCBR 2009), Springer, Heidelberg (2009)
Leake, D.B., Wilson, D.C.: Categorizing Case-Base Maintenance: Dimensions and Directions. In: Smyth, B., Cunningham, P. (eds.) EWCBR 1998. LNCS (LNAI), vol. 1488, pp. 196–207. Springer, Heidelberg (1998)
Texas Hold’em Article, http://en.wikipedia.org/wiki/Texas_Holdem
Morris, P.: Introduction to game theory. Springer, New York (1994)
Johanson, M. B.: Robust Strategies and Counter-Strategies: Building a Champion Level Computer Poker Player. Masters thesis, University of Alberta (2007)
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. Morgan Kaufmann, San Francisco (2003)
Gilpin, A., Sandholm, T.: A Competitive Texas Hold’em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation. In: Proceedings, The Twenty-First National Conference on Artificial Intelligence (AAAI 2006), pp. 1007–1013. AAAI Press, Menlo Park (2006)
Gilpin, A., Sandholm, T.: Better Automated Abstraction Techniques for Imperfect Information Games, with Application to Texas Hold’em Poker. In: 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), IFAAMAS, pp. 192–200 (2007)
Zinkevich, M., Johanson, M., Bowling, M.H., Piccione, C.: Regret Minimization in Games with Incomplete Information. In: Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, pp. 1729–1736. MIT Press, Cambridge (2007)
2009 Computer Poker Winners, http://www.cs.ualberta.ca/~pokert/2009/results/winners.txt
Billings, D., Davidson, A., Schauenberg, T., Burch, N., Bowling, M., Holte, R.C., Schaeffer, J., Szafron, D.: Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 21–34. Springer, Heidelberg (2006)
Billings, D., Castillo, L. P., Schaeffer, J., Szafron, D.: Using Probabilistic Knowledge and Simulation to Play Poker. In: AAAI/IAAI, pp. 697–703. AAAI Press, Menlo Park (1999)
Schweizer, I., Panitzek, K., Park, S.H., Furnkranz, J.: An Exploitative Monte-Carlo Poker Agent. Technical report, Technische Universitat Darmstadt (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)
Johanson, M., Zinkevich, M., Bowling, M. H.: Computing Robust Counter-Strategies. In: Advances in Neural Information Processing Systems 20, Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, pp. 721–728. MIT Press, Cambridge (2007)
Johanson, M., Bowling, M.: Data Biased Robust Counter Strategies. In: Twelfth International Conference on Artificial Intelligence and Statistics, pp. 264–271 (2009)
Rubin, J., Watson, I.: Investigating the Effectiveness of Applying Case-Based Reasoning to the Game of Texas Hold’em. In: Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, pp. 417–422. AAAI Press, Menlo Park (2007)
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)
2008 Poker Bot Competition Summary, http://www.cs.ualberta.ca/~pokert/2008/results/
2009 Poker Bot Competition Summary, http://www.cs.ualberta.ca/~pokert/2009/results/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rubin, J., Watson, I. (2010). Similarity-Based Retrieval and Solution Re-use Policies in the Game of Texas Hold’em. In: Bichindaritz, I., Montani, S. (eds) Case-Based Reasoning. Research and Development. ICCBR 2010. Lecture Notes in Computer Science(), vol 6176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14274-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-14274-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14273-4
Online ISBN: 978-3-642-14274-1
eBook Packages: Computer ScienceComputer Science (R0)