Monte-Carlo tree search and computer go

Studies in Computational Intelligence

Volumn 251, Issue , 2009, Pages 201-225

  Chen, Keh Hsun ^a   Du, Dawei ^a   Zhang, Peigang ^a  

^a University of North Carolina at Charlotte   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350231408     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-04141-9_10     Document Type: Review

References (27)

1. Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-number search. Artificial Intelligence 66(1), 91-124 (1994)
2. Bouzy, B.: Associating domain-dependent knowledge and monte carlo approaches within a go program. In: Chen, K. (ed.) Information Sciences, Heuristic Search and Computer Game Playing IV, vol. 175, pp. 247-257 (2005)
3. Brügmann, B.: Monte Carlo Go (1993), http://www.ideanest.com/vegos/ MonteCarloGo.pdf
4. Cazenave, T.: Abstract Proof Search. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 39-54. Springer, Heidelberg (2002)
5. Chaslot, G.M.J.B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for monte-carlo tree search. In: Wang, P., et al. (eds.) Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pp. 655-661. World Scientific Publishing Co. Pte. Ltd, Singapore (2007)
6. Chatriot, L., Gelly, S., Hoock, J.B., Perez, J., Rimmel, A., Teytaud, O.: Including expert knowledge in bandit-based Monte-Carlo planning with application to Computer Go. In: The 10th European Workshop on Reinforcement Learning (EWRL 2008), Lille, France (2008)
7. Chen, K.: Heuristic Programming in Artificial Intelligence. In: Levy, D., Beal, D. (eds.) Group Identification in Computer Go, pp. 195-210. Ellis Horwood (Fall 1989)
8. Chen, K., Chen, Z.: Static Analysis of Life and Death in the game of Go. Information Sciences 121(1-2), 113-134 (1999)
9. Chen, K.: Computer Go: Knowledge, Search, and Move Decision. ICGA Journal 24(4), 203-215 (2001)
10. Chen, K.: Maximizing the Chance of Winning in Searching Go Game Trees. Information Sciences 175, 273-283 (2005)
11. Chen, K., Zhang, P.: A New Heuristic Search Algorithm for Capturing Problems in Go. ICGA Journal 29(4), 183-190 (2006)
12. Chen, K.: Connectivity in the Game of Go. New Mathematics and Natural Computation 2(2), 147-159 (2006)
13. Chen, K., Zhang, P.: Monte-Carlo Go with Knowledge-guided simulations. ICGA Journal 31(2), 67-76 (2008)
14. Chen, K., Du, D., Zhang, P.: A Fast Indexing Method for Monte-Carlo Go. In: Van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 92-101. Springer, Heidelberg (2008)
15. Coulom, R.: Efficient selectivity and backup operators in monte-carlo tree search. In: Ciancarini, P., van den Herik, H.J. (eds.) Proceedings of the 5th International Conference on Computers and Games, Turin, Italy (2006)
16. Coulom, R.: Computing Elo Ratings of Move Patterns in the Game of Go. In: Van den Herik, H.J., Uiterwijk, J.W.H.M., Winands, M.H.M., Schadd, M.P.D. (eds.) Proceedings of the Computers Games Workshop 2007 (CGW 2007), pp. 113-124 (2007)
17. Gelly, S., Silver, D.: Combining online and offline knowledge in uct. In: ICML 2007: Proceedings of the 24th international conference on Machine learning, pp. 273-280. ACM Press, New York (2007)
18. Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modifications of UCT with Patterns in Monte-Carlo Go. Technical Report 6062, INRIA (2006)
19. Gelly, S., Silver, D.: Combining Online and Offline Knowledge in UCT. In: Ghahramani, Z. (ed.) Proceedings of the International Conference of Machine Learning (ICML 2007), pp. 273-280 (2007)
20. Gelly, S., Hoock, J.B., Rimmel, A., Teytaud, O., Kalemkarian, Y.: The parallelization of Monte-Carlo planning. In: Proceedings of the 4th International Conference on Informatics in Control, Automation and Robotics (ICINCO), Madeira, Portugal, pp. 198-203 (2008)
21. Kano, Y.: Graded Go Problems For Beginners, Intermediate Problems, vol. 3. Kiseido Publishing Company (1987) ISBN 4-906574-48-3
22. Knuth, D., Moore, R.: Analysis of Alpha-Beta Pruning. Artificial Intelligence 6(4), 293-326 (1975)
23. Kierulf, A., Chen, K., Nievergelt, J.: Smart Game Board and Go Explorer: A study in software and knowledge engineering. Communications of ACM 33(2), 152-166 (1990)
24. Kocsis, L., Szepesvári, C.: Bandit Based Monte-Carlo Planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282-293. Springer, Heidelberg (2006)
25. Wang, Y., Gelly, S.: Modifications of UCT and sequence-like simulations for MonteCarlo Go. In: IEEE Symposium on Computational Intelligence and Games, Honolulu, Hawaii, pp. 175-182 (2007)
26. Zhang, P., Chen, K.: Monte-Carlo Go Tactic Search. New Mathematics and Natural Computation Journal 4(3), 359-367 (2008)
27. Zhang, P., Chen, K.: Using Different Search Algorithms to Solve Computer Go Capturing Problems. In: Proceedings of 2006 Chinese Computer Games Conference, pp. 55-61 (2006) (in Chinese)