A comparison of Monte-Carlo methods for phantom go

Belgian/Netherlands Artificial Intelligence Conference

Volumn , Issue , 2007, Pages 57-64

  Borsboom, Joris ^a   Saito, Jahn Takeshi ^a   Chaslot, Guillaume ^a   Uiterwijk, Jos W H M ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GO; IMPERFECT INFORMATION; MONTE CARLO; MONTE-CARLO TREE SEARCHES; SELF-PLAY;

ARTIFICIAL INTELLIGENCE;

HEURISTIC METHODS;

EID: 79960529951     PISSN: 15687805     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Andrea Bolognesi and Paolo Ciancarini. Searching over Metapositions in Kriegspicl. In H. Jaap van den Herik, Yugvi Björnssou, and Nathan S. Netanyahu, editors. Computers and Games, volume 3846 of Lecture Notes in Computer Science, pages 246-261. Springer-Verlag, 2006.
2. Juris Borsboom. Phantom Go. Master's thesis, Universiteit Maastricht MICC-IKAT. August 2007.
3. Bruno Bouzy and Guillaume Chaslot. Monte-Carlo Go Reinforcement Learning Experiments. In Sushil J. Louis and Graham Kendall, editors, Computational Intelligence in Games, pages 187-194. IEEE, 2006.
4. Bruno Bouzy and Bernd Helmstettcr. Monte Carlo Developments. In H. Jaap van den Herik, Hiroyuki Iida, and Ernst A. Heinz, editors, Proceedings of the Advances in Computer Gaines Conference. (ACG-10), pages 159-174, Boston, USA, 2003. Kluwer Academic.
5. Bernd Briigmann. Monte Carlo Go. White, paper. 1993.
6. Tristan Cazenave. A Phantom-Go Program. In H. Jaap van den Herik, Shun chin Hsu. Tsan sheng Hsu, and H. H. L. M. Donkers, editors, Advances in Computer Games, (ACG 11), LNCS, pages 120-126, Springer-Verlag, Berlin. 2005.
7. Guillaume Chaslot, Jahn-Takeshi Saito, Bruno Bouzy, Jos W. H. M. Uiterwijk, and H. Jaap van den Herik. Monte-Carlo Strategies for Computer Go. In Pierre-Yves Schobbens, Wim Van-hoof, and Gabriel Schwanen, editors, Proceedings of the 18th Belgium-Netherlands Conference on Artificial Intelligence, Namur, Belgium, pages 83-91, 2006.
8. Paolo Ciancarini and Ota.u Piero Favini. A Program to Play Kriegspicl. ICG A Journal. 30(1):3 24, 2007.
9. Rémi Couloni. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In Paolo Ciancarini, H. Jaap van den Herik. and Jeroen H.L.M. Donkers. editors, Proceedings of the Fifth Computers and Games Conference, LNCS. Springer-Verlag, Berlin, 2007. 12 pages, in print.
10. Levente Kocsis and Csaba Szepesvári. Bandit Based Monte-Carlo Planning. In Johannes Fiirnkranz, Tobias Scheffer, and Myra Spiliopoulou. editors, Proceedings of the EMCL 2006, volume 4212 of LNCS, pages 282-293. Springer-Verlag. Berlin, 2006.
11. Austin Parker, Dana Nau, and V.S. Subrahmaniau. Game-Tree Search with Combinatorially Large Belief States. In Leslie Pack Kaelbling and Alessandro Saffiotti, editors, LICA1-05. Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pages 254-259, Edinburgh, Scotland, UK, 2005. Professional Book Center. ISBN 0938075934.
12. Jahn-Takeshi Saito, Mark H. M. Winands, Jos W.H.M. Uiterwijk, and H. Jaap van den Herik. Grouping Nodes for Monte-Carlo Tree Search. In Jos W.H.M. Uiterwij. Maarten Schadd, Mark H.M. Winands, and H. Jaap van den Herik, editors, Proceedings of the. Computer Games Workshop 2001 (CGW 2007), volume 07-06 of MICC Technical Report Series, pages 125-132, Maastricht, The Netherlands, 2007.
13. Makoto Sakuta and Hiroyuki Iida. Solving Kriegspiel-like Problems: Exploiting a Transposition Table. ICG A Journal. 23(4):218-229, 2000.
14. Eric C. D. van der Werf. AI techniques for the game of Go. PhD thesis, Universiteit Maastricht, 2004.