M. Buro, Toward opening book learning, ICCA Journal, vol.22, pp.98-102, 1999.

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.

P. Collet, E. Lutton, F. Raynal, and M. Schoenauer, Polar ifs + parisian gp = efficient inverse ifs problem solving, Genetic Programming and Evolvable Machines, vol.1, issue.4, pp.339-361, 2000.
DOI : 10.1023/A:1010065123132
URL : https://hal.archives-ouvertes.fr/inria-00000097

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

C. Donninger and U. Lorenz, Innovative Opening-Book Handling, Lecture Notes in Computer Science, vol.4250, pp.1-10, 2006.
DOI : 10.1007/11922155_1

P. Drake and Y. Chen, Coevolving partial strategies for the game of go, International Conference on Genetic and Evolutionary Methods, 2008.

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, ECML'06, pp.282-293, 2006.
DOI : 10.1007/11871842_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1296

M. Müller, Computer Go, Artificial Intelligence, vol.134, issue.1-2, pp.145-179, 2002.
DOI : 10.1016/S0004-3702(01)00121-7

J. Nagashima, T. Hashimoto, and H. Iida, SELF-PLAYING-BASED OPENING BOOK TUNING, New Mathematics and Natural Computation, vol.02, issue.02, pp.183-194, 2006.
DOI : 10.1142/S1793005706000452

C. Ong, H. Quek, K. Tan, and A. Tay, Discovering Chinese Chess Strategies through Coevolutionary Approaches, 2007 IEEE Symposium on Computational Intelligence and Games, pp.360-367, 2007.
DOI : 10.1109/CIG.2007.368121

L. Péret and F. Garcia, On-line search for solving markov decision processes via heuristic sampling, ECAI, pp.530-534, 2004.

O. Teytaud and H. Fournier, Lower Bounds for Evolution Strategies Using VC-Dimension, Lecture Notes in Computer Science, vol.5199, pp.102-111, 2008.
DOI : 10.1007/978-3-540-87700-4_11
URL : https://hal.archives-ouvertes.fr/inria-00287845

J. Tromp and G. Farnebäck, Combinatorics of Go, Proceedings of 5th International Conference on Computer and Games, 2006.
DOI : 10.1007/978-3-540-75538-8_8

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