Successful Performance via Decision Generalisation in No Limit Texas Hold'em
暂无分享,去创建一个
[1] Troels Bjerre Lund,et al. A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs , 2008, AAMAS.
[2] Guy Van den Broeck,et al. Monte-Carlo Tree Search in Poker Using Expected Reward Distributions , 2009, ACML.
[3] Kevin Waugh,et al. A demonstration of the Polaris poker system , 2009, AAMAS.
[4] Rickard Andersson. Pseudo-Optimal Strategies in No-Limit Poker , 2006, J. Int. Comput. Games Assoc..
[5] A. Karimi,et al. Master‟s thesis , 2011 .
[6] Jonathan Schaeffer,et al. Approximating Game-Theoretic Optimal Strategies for Full-scale Poker , 2003, IJCAI.
[7] Maarten van Someren,et al. Advances in Machine Learning , 2021, Advances in Computational Intelligence and Learning.
[8] Tuomas Sandholm,et al. The State of Solving Large Incomplete-Information Games, and Application to Poker , 2010, AI Mag..
[9] Janet L. Kolodner,et al. Case-Based Reasoning , 1989, IJCAI 1989.
[10] Ian D. Watson,et al. Similarity-Based Retrieval and Solution Re-use Policies in the Game of Texas Hold'em , 2010, ICCBR.
[11] Ian D. Watson,et al. Computer poker: A review , 2011, Artif. Intell..