Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
暂无分享,去创建一个
Nathan R. Sturtevant | Michael Buro | Timothy Furtak | Jeffrey Richard Long | Nathan R Sturtevant | M. Buro | T. Furtak | J. Long | Timothy Furtak
[1] Ian Frank,et al. Search in Games with Incomplete Information: A Case Study Using Bridge Card Play , 1998, Artif. Intell..
[2] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[3] Nathan R. Sturtevant,et al. An Analysis of UCT in Multi-Player Games , 2008, J. Int. Comput. Games Assoc..
[4] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.
[5] Matthew L. Ginsberg,et al. GIB: Imperfect Information in a Computationally Challenging Game , 2011, J. Artif. Intell. Res..
[6] Jonathan Schaeffer,et al. Approximating Game-Theoretic Optimal Strategies for Full-scale Poker , 2003, IJCAI.