R. Agrawal, The Continuum-Armed Bandit Problem, SIAM Journal on Control and Optimization, vol.33, issue.6, pp.1926-1951, 1995.
DOI : 10.1137/S0363012992237273

P. Auer, N. Cesa-bianchi, and P. Fischer, « Finite-time analysis of the multiarmed bandit problem, Machine Learning, pp.235-256, 2002.

J. S. Banks and R. K. Sundaram, Denumerable-Armed Bandits, Econometrica, vol.60, issue.5, pp.1071-96, 1992.
DOI : 10.2307/2951539

URL : http://authors.library.caltech.edu/67326/1/2951539.pdf

B. Bouzy, Associating domain-dependent knowledge and Monte Carlo approaches within a Go program, Information Sciences, Heuristic Search and Computer Game Playing IV, pp.247-257, 2005.
DOI : 10.1016/j.ins.2004.04.010

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

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.

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. Coquelin and R. Munos, « Bandit Algorithms for Tree Search, Proceedings of UAI'07, 2007.

R. Coulom and . Efficient, 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.

V. Dani and T. P. Hayes, Robbing the bandit, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.937-943, 2006.
DOI : 10.1145/1109557.1109660

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

L. Ralaivola, L. Wu, and P. Baldi, « SVM and pattern-enriched common fate graphs for the game of Go, Proceedings of ESANN 2005, pp.485-490, 2005.

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

. Article-reçu-le, Version révisée le 04 Rédacteur responsable : GUILLAUME LAURENT SERVICE ÉDITORIAL ? HERMES-LAVOISIER 14 rue de Provigny, F-94236 Cachan cedex Tél, pp.1-47, 1996.