Monte-Carlo simulation balancing applied to 9 × 9 Go

ICGA Journal

Volumn 33, Issue 4, 2010, Pages 191-201

  Huang, Shih Chieh ^a   Coulom, Rémi ^b   Lin, Shun Shii ^a  

^a NATIONAL TAIWAN NORMAL UNIVERSITY   (Taiwan)

^b UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79960538544     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/ICG-2010-33402     Document Type: Article

References (25)

1. Abramson, B. (1990). Expected-Outcome: A General Model of Static Evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 12, No. 2, pp. 182-193.
2. Anderson, D. A. (2009). Monte Carlo Search in Games. Technical report, Worcester Polytechnic Institute.
3. Bouzy, B. (2005). Associating domain-dependent knowledge and Monte-Carlo approaches within a Go program. Information Sciences, Heuristic Search and Computer Game Playing IV, Vol. 175, No. 4, pp. 247-257.
4. Bouzy, B. and Chaslot, G. (2006). Monte-Carlo Go Reinforcement Learning Experiments. 2006 IEEE Symposium on Computational Intelligence and Games (eds. G. Kendall and S. Louis), pp. 187-194, Reno, USA.
5. Bouzy, B. and Helmstetter, B. (2003). Monte Carlo Go Developments. Proceedings of the 10th Advances in Computer Games Conference (eds. H. J. van den Herik, H. Iida, and E. A. Heinz), pp. 159-175, Kluwer Academic Publishers, Norwell, Massachusetts.
6. Brügmann, B. (1993). Monte Carlo Go. Unpublished technical report.
7. Chaslot, G., Fiter, C., Hoock, J.-B., Rimmel, A., and Teytaud, O. (2009). Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. Proceedings of the Twelfth International Advances in Computer Games Conference (eds. H. J. van den Herik and P. Spronck), Vol. 6048 of Lecture Notes in Computer Science, pp. 1-14, Springer, Heidelberg, Germany.
8. Chaslot, G., Winands, M., Bouzy, B., Uiterwijk, J. W. H. M., and Herik, H. J. van den (2007). Progressive Strategies for Monte-Carlo Tree Search. Proceedings of the 10th Joint Conference on Information Sciences (ed. P. Wang), pp. 655-661, Salt Lake City, USA.
9. Chaslot, G. M. J.-B., Winands, M. H. M., Szita, I., and Herik, H. J. van den (2008). Cross-Entropy for MonteCarlo tree search. ICGA Journal, Vol. 31, No. 3, pp. 145-156.
10. Chen, K.-H. and Zhang, P. (2008). Monte-Carlo Go with Knowledge-Guided Simulations. ICGA Journal, Vol. 31, No. 2, pp. 67-76.
11. Chung-Hsiung, L. (2009). web2go web site, http://www.web2go.idv.tw/gopro/ .
12. Coulom, R. (2006). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. Proceedings of the 5th International Conference on Computer and Games (eds. H. J. van den Herik, P. Ciancarini, and H. J. Donkers), Vol. 4630 of Lecture Notes in Computer Science, pp. 72-83, Springer, Heidelberg, Germany.
13. Coulom, R. (2007). Computing Elo Ratings of Move Patterns in the Game of Go. ICGA Journal, Vol. 30, No. 4, pp. 198-208.
14. Enzenberger, M. and Müller, M. (2009). Fuego - an open-source framework for board games and Go engine based on Monte-Carlo tree search. Technical Report TR 09-08, University of Alberta, Edmonton, Alberta, Canada.
15. Gelly, S. and Silver, D. (2007). Combining Online and Offline Knowledge in UCT. Proceedings of the 24th International Conference on Machine Learning, pp. 273-280, Corvallis Oregon USA.
16. Gelly, S., Wang, Y., Munos, R., and Teytaud, O. (2006). Modification of UCT with Patterns in Monte-Carlo Go. Technical Report RR-6062, INRIA.
17. Glynn, P. W. (1987). Likelihood ratio gradient estimation: an overview. Proceedings of the 1987 Winter Simulation Conference (eds. A. Thesen, W. Grant, and W D. Kelton), pp. 366-375.
18. Goertz, U. and Shubert, W. (2007). Game Records in SGF Format. http://www.u-go.net/ gamerecords/.
19. Hunter, D. R. (2004). MM Algorithms for Generalized Bradley-Terry Models. The Annals of Statistics, Vol. 32, No. 1, pp. 384-406.
20. Kocsis, L. and Szepesvári, C. (2006). Bandit-Based Monte-Carlo Planning. Proceedings of the 15th European Conference on Machine Learning (eds. J. Fürnkranz, T. Scheffer, and M. Spiliopoulou), Berlin, Germany.
21. Schraudolph, N. N. (1999). Local Gain Adaptation in Stochastic Gradient Descent. Proceedings of the 9th International Conference on Artificial Neural Networks, IEEE, London.
22. Silver, D. (2009). Message to the computer-go mailing list, http://www.mail-archive.com/ computer-go@computer-go.org/msg11260.html.
23. Silver, D. and Tesauro, G. (2009). Monte-Carlo Simulation Balancing. Proceedings of the 26th International Conference on Machine Learning (eds. L. Bottou and M. Littman), pp. 945-952, Omnipress, Montreal, Canada.
24. Williams, R. J. (1992). Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning. Machine Learning, No. 8, pp. 229-256.
25. Zermelo, E. (1929). Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung. Mathematische Zeitschrift, Vol. 29, pp. 436-460.