P. Audouard, G. Chaslot, J. Hoock, A. Rimmel, J. Perez et al., Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go, Mathematics of Computing/G.0: GENERAL, 2009.
DOI : 10.1007/978-3-642-01129-0_36
URL : https://hal.archives-ouvertes.fr/inria-00369783

G. Chaslot, M. Winands, J. Uiterwijk, H. Herik, . Van et al., Progressive Strategies for Monte-Carlo Tree Search, Proceedings of the 10th Joint Conference on Information Sciences, pp.655-661, 2007.

G. Chaslot, J. Saito, B. Bouzy, J. W. Uiterwijk, H. J. Herik et al., Monte- Carlo Strategies for Computer Go, Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, pp.83-91, 2006.

R. Coulom, Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search, Proceedings of the 5th International Conference on Computers and Games, 2006.
DOI : 10.1007/978-3-540-75538-8_7
URL : https://hal.archives-ouvertes.fr/inria-00116992

R. Coulom, Computing Elo Ratings of Move Patterns in the Game of Go, Computer Games Workshop, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00149859

S. Gelly and D. Silver, Combining online and offline knowledge in UCT, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.273-280, 2007.
DOI : 10.1145/1273496.1273531
URL : https://hal.archives-ouvertes.fr/inria-00164003

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, pp.282-293, 2006.
DOI : 10.1007/11871842_29

C. Lee, M. Wang, G. Chaslot, J. Hoock, A. Rimmel et al., The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments, IEEE Transactions on Computational Intelligence and AI in games, 2009.

D. Lichtenstein and M. Sipser, GO Is Polynomial-Space Hard, Journal of the ACM, vol.27, issue.2, pp.393-401, 1980.
DOI : 10.1145/322186.322201

J. M. Robson, The Complexity of Go, pp.413-417, 1983.