Current frontiers in computer go

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 2, Issue 4, 2010, Pages 229-238

  Rimmel, Arpad ^a   Teytaud, Olivier ^a   Lee, Chang Shing ^b   Yen, Shi Jim ^c   Wang, Mei Hui ^b   Tsai, Shang Rong ^d  

^a INRIA SACLAY   (France)

^b NATIONAL UNIVERSITY OF TAINAN   (Taiwan)

^c NATIONAL DONG HWA UNIVERSITY   (Taiwan)

^d CHANG JUNG CHRISTIAN UNIVERSITY   (Taiwan)

Author keywords

Game of Go; Monte Carlo tree search (MCTS); upper confidence

Indexed keywords

BEST PROGRAM; COMPUTER GO; GAME OF GO; HUMAN LEVELS; MONTE CARLO; TECHNICAL ADVANCES; TREE SEARCH; UPPER CONFIDENCE;

FUZZY SETS;

MONTE CARLO METHODS;

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

References (40)

1. R. Coulom, "Efficient selectivity and backup operators in Monte-Carlo tree search," in Proc. 5th Int. Conf. Comput. Games, P. Ciancarini and H. J. van den Herik, Eds., Turin, Italy, 2006, pp. 72-83.
2. G. Chaslot, M.Winands, J. Uiterwijk, H. van den Herik, and B. Bouzy, "Progressive strategies for Monte-Carlo tree search," in Proc. 10th Joint Conf. Inf. Sci., P. Wang, Ed. et al., 2007, pp. 655-661.
3. L. Kocsis and C. Szepesvari, "Bandit-based Monte Carlo planning," in Proc. Eur. Conf. Mach. Learn., 2006, pp. 282-293.
4. T. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," in Advances in Applied Mathematics. New York: Elsevier, 1985, vol. 6, pp. 4-22.
5. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in Proc. 24th Int. Conf. Mach. Learn., New York, 2007, pp. 273-280.
6. S. Sharma, Z. Kobti, and S. Goodwin, "Knowledge generation for improving simulations in UCT for general game playing," in Proc. 21st Australasian Joint Conf. Artif. Intell., Berlin, Heidelberg, 2008, pp. 49-55.
7. Y. Wang and S. Gelly, "Modifications of UCT and sequence-like simulations for Monte-Carlo Go," in Proc. IEEE Symp. Comput. Intell. Games, Honolulu, HI, 2007, pp. 175-182.
8. R. Coulom, "Computing ELO ratings of move patterns in the game of go," in Proc. Computer Games Workshop, Amsterdam, The Netherlands, 2007.
9. Y. Wang, J. Y. Audibert, and R. Munos, "Algorithms for infinitely many-armed bandits," Advances Neural Inf. Process. Syst., vol. 21, 2008.
10. P. Rolet, M. Sebag, and O. Teytaud, "Optimal active learning through billiards and upper confidence trees in continuous domains," in Proc. Eur. Conf. Mach. Learn., 2009.
11. F. Teytaud and O. Teytaud, "Creating an upper-confidence-tree program for Havannah," in Proc. Adv. Comput. Games, Pamplona, Spain, 2009.
12. B. Bouzy and G. Chaslot, G. Kendall and Simon Lucas, Eds., "Bayesian generation and integration of k-nearest-neighbor patterns for 19×19 Go," in Proc. IEEE Symp. Comput. Intell. Games, Colchester, U.K., 2005, pp. 176-181.
13. G. Chaslot, C. Fiter, J. B. Hoock, A. Rimmel, and O. Teytaud, "Adding expert knowledge and exploration in Monte-Carlo tree search," in Proc. Adv. Comput. Games, Pamplona, Spain, 2009.
14. C. S. Lee, M. H. Wang, G. Chaslot, J. B. Hoock, A. Rimmel, O. Teytaud, S. R. Tsai, S. C. Hsu, and T. P. Hong, "The computational intelligence of MoGo revealed in Taiwan's Computer Go tournaments," IEEE Trans. Comput. Intell. AI Games, vol. 1, no. 1, pp. 73-89, Mar. 2009.
15. L. Ralaivola, L.Wu, and P. Baldi, "SVM and pattern-enriched common fate graphs for the game of go," in Proc. Eur. Symp. Artif. Neural Netw., 2005, pp. 485-490.
16. R. Coulom, "Criticality: A Monte-Carlo heuristic for go programs," Tokyo, Japan, Invited talk at the University of Electro-Communications, 2009.
17. B. Bruegmann, "Monte Carlo Go," 1993.
18. B. Bouzy and B. Helmstetter, "Monte-Carlo Go developments," 2003.
19. S. Gelly, Y. Wang, R. Munos, and O. Teytaud, "Modification of UCT with patterns in Monte-Carlo Go," Inria, France, Rapport de Recherche INRIA RR-6062, 2006.
20. D. Silver and G. Tesauro, "Monte-Carlo simulation balancing," in Proc. Int. Conf. Mach. Learn., 2009, pp. 119-119.
21. S. C. Huang, R. Coulom, and S. S. Lin, "Monte-Carlo simulation balancing in practice," in Proc. Int. Conf. Comput. Games, 2010.
22. T. Cazenave, "Playing the right atari," Int. Comput. Games Assoc. J., vol. 30, pp. 35-42, 2007.
23. P. Audouard, G. Chaslot, J. B. Hoock, J. Perez, A. Rimmel, and O. Teytaud, "Grid coevolution for adaptive simulations; application to the building of opening books in the game of go," Proc. EvoGames, 2009.
24. R. Coulom, "Lockless Hash table and other parallel search ideas," Post on the Computer-Go Mailing List, 2008.
25. M. Enzenberger and M. Müller, "A lock-free multithreaded Monte-Carlo tree search algorithm," in Proc. Adv. Comput. Games 12, 2009.
26. S. Gelly, J. B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, "The parallelization of Monte-Carlo planning," in Proc. Int. Conf. Inf. Control Autom. Robot., 2008, pp. 198-203.
27. G. Chaslot, M. Winands, and H. van den Herik, "Parallel Monte-Carlo tree search," in Proc. Conf. Comput. Games, 2008.
28. T. Cazenave and N. Jouandeau, "On the parallelization of UCT," in Proc. CGW07, 2007, pp. 93-101.
29. H. Kato and I. Takeuchi, "Parallel Monte-Carlo tree search with simulation servers," in Proc. 13th Game Programm. Workshop, 2008.
30. T. Cazenave and B. Helmstetter, "Combining tactical search and Monte-Carlo in the game of go," in Proc. IEEE Symp. Comput. Intell. Games, 2005, pp. 171-175.
31. A. Auger and O. Teytaud, "Continuous lunches are free plus the design of optimal optimization algorithms," Algorithmica, vol. 57, no. 1, pp. 121-146, 2009.
32. F. de Mesmay, A. Rimmel, Y. Voronenko, and M. Puschel, "Bandit-based optimization on graphs with application to library performance tuning," in Proc. Annu. Int. Conf. Mach. Learn., DOI: 10.1145/1553374.1553468.
33. N. R. Sturtevant, "An analysis of UCT in multi-player games," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, vol. 5131, pp. 37-49.
34. T. Cazenave, "Multi-player Go," vol. 40, pp. 50-59.
35. I. Szita, G. Chaslot, and P. Spronck, "Monte Carlo tree search in settlers of Catan," in Proc. 12th Adv. Comput. Games Conf., 2009.
36. M. H. M. Winands, Y. Björnsson, and J. T. Saito, "Monte-Carlo tree search solver," vol. 40, pp. 25-36.
37. T. Cazenave, A Phantom-Go Program, ser. Lecture Notes in Computer Science, H. J. van den Herik, S. chin Hsu, T. Sheng Hsu, and H. H. L. M. Donkers, Eds. Berlin, Germany: Springer-Verlag, 2006, vol. 4250, pp. 120-125.
38. T. Cazenave and J. Borsboom, "Golois wins phantom go tournament," Int. Comput. Games Assoc. J., vol. 30, pp. 165-166, 2007.
39. A. P. Danyluk, L. Bottou, and M. L. Littman, Eds., in Proc. 26th Annu. Int. Conf. Mach. Learn., Montreal, QC, Canada, Jun. 14-18, 2009.
40. H. J. van den Herik, X. Xu, Z. Ma, and M. H. M.Winands, Eds., in Proc. 6th Int. Conf. Comput. Games, Beijing, China, China, Oct. 1, 2008.