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

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

B. Bouzy and G. Chaslot, Bayesian generation and integration of k-nearest-neighbor patterns for 19x19 go, IEEE 2005 Symposium on Computational Intelligence in Games, pp.176-181, 2005.

. Tsai, Current Frontiers in Computer Go, IEEE Transactions on Computational Intelligence and Artificial Intelligence in Games, p. in press, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00544622

T. Cazenave and N. Jouandeau, On the parallelization of UCT, Proceedings of CGW07, pp.93-101, 2007.

S. Gelly, J. B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, The parallelization of Monte-Carlo planning, Proceedings of the International Conference on Informatics in Control, Automation and Robotics, pp.198-203, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00287867

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

A. D. Groot, Thought and choice in chess, 1978.

A. De-groot, F. Gobet, and R. Jongman, Perception and memory in chess: Studies in the heuristics of the professional eye, 1996.

F. Gobet and H. Simon, Recall of random and distorted chess positions: Implications for the theory of expertise, Memory & Cognition, vol.13, issue.4, pp.493-503, 1996.
DOI : 10.3758/BF03200937

T. Hoock, A. Hérault, F. Rimmel, O. Teytaud, P. Teytaud et al., Scalability and parallelization of monte-carlo tree search, Proceedings of Advances in Computer Games 13, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00512854

K. Chairasmisak, Enseignements d'un dirigeant asiatique (exists in Chinese). D'organisation, 2005.

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, IFIP Congress, pp.413-417, 1983.