P. Auer, N. Cesa-bianchi, and P. Fisher, Finite-time Analysis of the Multiarmed Bandit Problem, Machine Learning, vol.47, pp.2-3235, 2002.

A. Blum and M. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.1636-1642, 1997.
DOI : 10.1016/S0004-3702(96)00047-1

V. Bulitko and G. Lee, Learning in Real-Time Search: A Unifying Framework, Journal of Artificial Intelligence Research, vol.25, pp.119-157, 2006.

S. Gelly, Y. Wang, R. Munos, and O. Teytaud, Modification of UCT with Patterns in Monte-Carlo Go, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00117266

P. Hart, N. Nilsson, and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

J. Hoffmann and B. Nebel, The FF Planning System: Fast Plan Generation Through Heuristic Search, JAIR, vol.14, issue.1, pp.253-302, 2001.

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, Proc. ECML, pp.282-293, 2006.
DOI : 10.1007/11871842_29

R. Korf, Real-time heuristic search, Proceedings of the AAAI conference, pp.139-144, 1988.
DOI : 10.1016/0004-3702(90)90054-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.809

R. Korf, Real-time heuristic search, Artificial Intelligence, vol.42, issue.2-3, pp.189-211, 1990.
DOI : 10.1016/0004-3702(90)90054-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.809