Evaluating root parallelization in Go

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 2, Issue 4, 2010, Pages 278-287

  Soejima, Yusuke ^a   Kishimoto, Akihiro ^b,c   Watanabe, Osamu ^b  

^a Panasonic Corporation   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Computer Go; majority voting; Monte Carlo tree search (MCTS); root parallelization; tree parallelization

Indexed keywords

BEST PROGRAM; CENTRAL PROCESSING UNITS; COMPUTER GO; MAJORITY VOTING; MONTE CARLO; NEW STRATEGY; PARALLELIZATIONS; PARALLELIZING; SHOW THROUGH; TREE SEARCH;

PROGRAM PROCESSORS;

MONTE CARLO METHODS;

EID: 78951493510     PISSN: 1943068X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCIAIG.2010.2096427     Document Type: Article

References (23)

1. L. Kocsis and C. Szepesvári, "Bandit based Monte-Carlo planning," in Proceedings of the 17th European Conference on Machine Learning, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2006, vol. 4212, pp. 282-293.
2. S. Gelly, Y. Wang, R. Munos, and O. Teytaud, "Modification of UCT with patterns in Monte-Carlo Go," INRIA, France, Tech. Rep. 6062, 2006.
3. R. Coulom, "Computing Elo ratings of move patterns in the game of Go," Int. Comput. Games Assoc. J., vol. 30, no. 4, pp. 198-208, 2007.
4. M. Enzenberger and M. Müller, "Fuego-An open-source framework for board games and Go engine based on Monte-Carlo tree search," Univ. Alberta, Edmonton, AB, Canada, TR 09-08, 2009.
5. M. Enzenberger, M. Müller, B. Arneson, and R. Segal, "FUEGO-An open-source framework for board games and Go engine based on Monte Carlo tree search," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 259-270, Dec. 2010.
6. M. Enzenberger and M. Müller, "A lock-free multithreaded Monte-Carlo tree search algorithm," in Advances in Computer Games 12, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2010, vol. 6048, pp. 14-20.
7. S. Gelly, J. B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, "The parallelization of Monte-Carlo planning," in Proc. 5th Int. Conf. Inf. Control Autom. Robot., 2008, pp. 198-203.
8. T. Cazenave and N. Jouandeau, "On the parallelization of UCT," in Proc. Comput. Games Workshop, 2007, pp. 93-101.
9. G. M. J.-B. Chaslot, M. H. M. Winands, and H. J. van den Herik, "Parallel Monte-Carlo tree search," in Proceedings of the 6th International Conference on Computer and Games, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2008, vol. 5131, pp. 60-71.
10. G. M. J.-B. Chaslot, M. H. M. Winands, J. W. H. M. Uiterwijk, H. J. van den Herik, and B. Bouzy, "Progressive strategies for Monte-Carlo tree search," New Math. Natural Comput., vol. 4, no. 3, pp. 343-357, 2008.
11. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in Proc. 24th Int. Conf. Mach. Learn., 2009, pp. 273-280.
12. T. A. Marsland and F. Popowich, "Parallel game-tree search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 7, no. 4, pp. 442-452, Apr. 1985.
13. J. Schaeffer, "Distributed game-tree searching," J. Parallel Distrib. Comput., vol. 6, no. 2, pp. 90-114, 1989.
14. M. Brockington and J. Schaeffer, "APHID game-tree search," in Advances in Computer Chess. New York: Elsevier, 1997, vol. 8, pp. 69-91.
15. H. Kato and I. Takeuchi, "Parallel Monte-Carlo tree search with simulation servers," in Proc. 13th Game Programm. Workshop, 2008, pp. 31-38.
16. T. Cazenave and N. Jouandeau, "A parallel Monte-Carlo tree search algorithm," in Proceedings of the 6th International Conference on Computer and Games, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2008, vol. 5131, pp. 72-80.
17. M. G. Brockington, "A taxonomy of parallel game-tree search algorithms," Int. Comput. Chess Assoc. J., vol. 19, no. 3, pp. 162-174, 1996.
18. R. Feldmann, "Spielbaumsuche auf massiv parallelen systemen," Transl.:"Game tree search on massively parallel systems," Ph.D. dissertation, Dept. Math. Comput. Sci., Univ. Paderborn, Paderborn, Germany, 1993.
19. M. Müller, "Fuego at the Computer Olympiad in Pamplona 2009: A tournament report," Univ. Alberta, Edmonton, AB, Canada, TR 09-09, 2009.
20. Y. Freund and R. E. Schapire, "A decision-theoretic generalization of on-line learning and an application to boosting," J. Comput. Syst. Sci., vol. 55, no. 1, pp. 119-139, 1997.
21. T. Obata, M. Hanawa, and T. Ito, "Consultation algorithm in brain game-Effect of simple majority system (in Japanese)," Inf. Process. Soc. Jpn. (IPSJ) SIG Game Inf. Colloq., vol. 22, 2009.
22. M. Snir and W. Gropp, MPI: The Complete Reference. Cambridge, MA: MIT Press, 1998.
23. M. G. Brockington, "Asynchronous parallel game-tree search," Ph.D. dissertation, Dept. Comput. Sci., Univ. Alberta, Edmonton, AB, Canada, 1998.