B. Arneson, R. Hayward, and P. Henderson, Mohex wins hex tournament, ICGA journal, pp.114-116, 2009.
DOI : 10.3233/icg-2009-32218
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.2612

P. Auer, Using confidence bounds for exploitation-exploration trade-offs, The Journal of Machine Learning Research, vol.3, pp.397-422, 2003.

A. Bourki, G. Chaslot, M. Coulm, V. Danjean, H. Doghmen et al., Scalability and Parallelization of Monte-Carlo Tree Search, Proceedings of Advances in Computer Games 13, 2010.
DOI : 10.1007/978-3-642-17928-0_5
URL : https://hal.archives-ouvertes.fr/inria-00512854

B. Bouzy and T. Cazenave, Computer Go: An AI oriented survey, Artificial Intelligence, vol.132, issue.1, pp.39-103, 1993.
DOI : 10.1016/S0004-3702(01)00127-8
URL : http://doi.org/10.1016/s0004-3702(01)00127-8

A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

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

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

F. De-mesmay, A. Rimmel, Y. Voronenko, and M. Püschel, Bandit-based optimization on graphs with application to library performance tuning, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, p.92, 2009.
DOI : 10.1145/1553374.1553468
URL : https://hal.archives-ouvertes.fr/inria-00379523

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, 15th European Conference on Machine Learning (ECML), pp.282-293, 2006.
DOI : 10.1007/11871842_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1296

T. Lai and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-22, 1985.
DOI : 10.1016/0196-8858(85)90002-8
URL : http://doi.org/10.1016/0196-8858(85)90002-8

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.

H. Nakhost and M. Müller, Monte-carlo exploration for deterministic planning, IJCAI, pp.1766-1771, 2009.

N. Nethercote and J. Seward, Valgrind, ACM SIGPLAN Notices, vol.42, issue.6, pp.89-100, 2007.
DOI : 10.1145/1273442.1250746
URL : http://doi.org/10.1016/s1571-0661(04)81042-9

J. M. Robson, The complexity of go, IFIP Congress, pp.413-417, 1983.

P. Rolet, M. Sebag, and O. Teytaud, Optimal active learning through billiards and upper confidence trees in continous domains, Proceedings of the ECML conference, 2009.

S. Sharma, Z. Kobti, and S. Goodwin, Knowledge Generation for Improving Simulations in UCT for General Game Playing, AI '08: Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence, pp.49-55, 2008.
DOI : 10.1023/A:1013689704352

F. Teytaud and O. Teytaud, Creating an Upper-Confidence-Tree Program for Havannah, ACG 12, 2009.
DOI : 10.1007/978-3-642-12993-3_7
URL : https://hal.archives-ouvertes.fr/inria-00380539

F. Teytaud and O. Teytaud, On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms, Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, 2010.
DOI : 10.1109/ITW.2010.5593334
URL : https://hal.archives-ouvertes.fr/inria-00495078

Y. Wang and S. Gelly, Modifications of UCT and sequence-like simulations for Monte-Carlo Go, 2007 IEEE Symposium on Computational Intelligence and Games, pp.175-182, 2007.
DOI : 10.1109/CIG.2007.368095