Utilisation de la recherche arborescente Monte-Carlo au Hex
暂无分享,去创建一个
[1] Tristan Cazenave,et al. Playing the Right Atari , 2007, J. Int. Comput. Games Assoc..
[2] Thomas Thomsen. Lambda-Search in Game Trees - with Application to Go , 2000, Computers and Games.
[3] H. Jaap van den Herik,et al. Parallel Monte-Carlo Tree Search , 2008, Computers and Games.
[4] Olivier Teytaud,et al. Modification of UCT with Patterns in Monte-Carlo Go , 2006 .
[5] Vadim V. Anshelevich,et al. A hierarchical approach to computer Hex , 2002, Artif. Intell..
[6] Robert E. Tarjan,et al. A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.
[7] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.
[8] Nicolas Jouandeau,et al. A Parallel Monte-Carlo Tree Search Algorithm , 2008, Computers and Games.
[9] Denyse Baillargeon,et al. Bibliographie , 1929 .
[10] Stefan Reisch,et al. Hex ist PSPACE-vollständig , 1981, Acta Informatica.
[11] Ikuo Takeuchi,et al. Parallel Monte-Carlo Tree Search with Simulation Servers , 2010, 2010 International Conference on Technologies and Applications of Artificial Intelligence.
[12] Michael Bradley Johanson,et al. Dead Cell Analysis in Hex and the Shannon Game , 2006 .
[13] T. Cazenave,et al. On the Parallelization of UCT , 2007 .
[14] D. Gale. The Game of Hex and the Brouwer Fixed-Point Theorem , 1979 .
[15] Rémi Coulom,et al. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.
[16] Haig Keshishian,et al. Making the right connections , 1993, Nature.
[17] Cameron Browne,et al. Hex strategy - making the right connections , 2000 .
[18] Rémi Coulom,et al. Computing "Elo Ratings" of Move Patterns in the Game of Go , 2007, J. Int. Comput. Games Assoc..
[19] David Silver,et al. Combining online and offline knowledge in UCT , 2007, ICML '07.
[20] Tristan Cazenave. A Generalized Threats Search Algorithm , 2002, Computers and Games.