B. Arneson, R. B. Hayward, and P. Henderson, Monte-Carlo tree search in Hex. Computational Intelligence and AI in Games, IEEE Transactions on, vol.2, issue.4, pp.251-258, 2010.

B. Bouzy and G. Chaslot, Monte-Carlo Go Reinforcement Learning Experiments, 2006 IEEE Symposium on Computational Intelligence and Games, pp.187-194, 2006.
DOI : 10.1109/CIG.2006.311699

C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling et al., A survey of Monte-Carlo tree search methods. Computational Intelligence and AI in Games, IEEE Transactions on, vol.4, issue.1, pp.1-43, 2012.

T. Cazenave, . Monte-carlo, and . Kakuro, Monte-Carlo Kakuro, Lecture Notes in Computer Science, vol.6048, pp.45-54, 2009.
DOI : 10.1007/978-3-642-12993-3_5

G. Chaslot, J. T. Saito, B. Bouzy, J. Uiterwijk, and H. J. Van-den-herik, 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, Computers and games, pp.72-83, 2007.
DOI : 10.1007/978-3-540-75538-8_7

URL : https://hal.archives-ouvertes.fr/inria-00116992

S. Gelly, J. B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, On the parallelization of Monte-Carlo planning, p.ICINCO, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00287867

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. Szepesvári, Bandit Based Monte-Carlo Planning, Machine Learning: ECML 2006, pp.282-293, 2006.
DOI : 10.1007/11871842_29

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1296

R. J. Lorentz, Amazons Discover Monte-Carlo, Computers and games, pp.13-24, 2008.
DOI : 10.1007/978-3-540-87608-3_2

D. Robilliard, C. Fonlupt, and F. Teytaud, Monte-Carlo Tree Search for the Game of ???7 Wonders???, Computer Game workshop of European Conference on Artificial Intelligence (ECAI), 2010.
DOI : 10.1007/978-3-319-14923-3_5

URL : https://hal.archives-ouvertes.fr/hal-01406496

C. E. Shannon, XXII. Programming a computer for playing chess, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, vol.79, issue.314, pp.256-275, 1950.
DOI : 10.1080/14786445008521796

I. Szita, G. Chaslot, and P. Spronck, Monte-Carlo Tree Search in Settlers of Catan, Advances in Computer Games, pp.21-32, 2010.
DOI : 10.1007/978-3-642-12993-3_3

F. Teytaud and O. Teytaud, Creating an upper-confidence-tree program for Havannah Advances in Computer Games pp, pp.65-74, 2010.
DOI : 10.1007/978-3-642-12993-3_7

R. K. Winder, Methods for approximating value functions for the Dominion card game, Evolutionary Intelligence, vol.8, issue.1, 2013.
DOI : 10.1007/s12065-013-0096-9