Improving Monte-Carlo Tree Search in Havannah
暂无分享,去创建一个
[1] Tristan Cazenave. Iterative Widening , 2001, IJCAI.
[2] Rémi Coulom,et al. Computing "Elo Ratings" of Move Patterns in the Game of Go , 2007, J. Int. Comput. Games Assoc..
[3] Rémi Coulom,et al. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.
[4] Neil D. Lawrence,et al. Missing Data in Kernel PCA , 2006, ECML.
[5] David Silver,et al. Combining online and offline knowledge in UCT , 2007, ICML '07.
[6] Zongmin Ma,et al. Computers and Games , 2008, Lecture Notes in Computer Science.
[7] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.
[8] Olivier Teytaud,et al. Creating an Upper-Confidence-Tree Program for Havannah , 2009, ACG.
[9] Dap Hartmann. ON THE IMPORTANCE OF SELF-CONTAINED PAPERS , 2007 .
[10] Sylvain Gelly,et al. Exploration exploitation in Go: UCT for Monte-Carlo Go , 2006, NIPS 2006.
[11] Mark H. M. Winands,et al. Evaluation Function Based Monte-Carlo LOA , 2009, ACG.
[12] H. Jaap van den Herik,et al. Progressive Strategies for Monte-Carlo Tree Search , 2008 .
[13] Selim G. Akl,et al. The principal continuation and the killer heuristic , 1977, ACM '77.
[14] Olivier Teytaud,et al. Modification of UCT with Patterns in Monte-Carlo Go , 2006 .
[15] Csaba Szepesvári,et al. Empirical Bernstein stopping , 2008, ICML '08.