A. P. Cesa-bianchi-n and . Fischer-p, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.23, pp.235-256, 2002.

B. J. Sundaram-r, Denumerable-armed bandits, Econometrica, vol.60, issue.5, pp.1071-96, 1992.

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

C. G. Winands-m, U. J. Van-den, and H. H. Bouzy-b, Progressive strategies for monte-carlo tree search, Proceedings of the 10th Joint Conference on Information Sciences, pp.655-661, 2007.

C. Munos-r, Bandit algorithms for tree search, Proceedings of UAI'07, 2007.

D. V. Hayes-t, Robbing the bandit : less regret in online geometric optimization against an adaptive adversary, SODA '06 : Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp.937-943, 2006.

G. S. Silver-d, Combining online and offline knowledge in uct, ICML '07 : Proceedings of the 24th international conference on Machine learning, pp.273-280, 2007.

K. L. Szepesvari-c, Bandit-based monte-carlo planning, ECML'06, pp.282-293, 2006.

L. T. Robbins-h, Asymptotically efficient adaptive allocation rules, Advances in applied mathematics, vol.6, pp.4-22, 1985.

R. L. Wu-l and . Baldi-p, Svm and pattern-enriched common fate graphs for the game of go, Proceedings of ESANN 2005, pp.485-490, 2005.

W. Y. Gelly-s, Modifications of UCT and sequence-like simulations for Monte-Carlo Go, IEEE Symposium on Computational Intelligence and Games, pp.175-182, 2007.