R. Bjarnason, A. Fern, and P. Tadepalli, Lower Bounding Klondike Solitaire with Monte-Carlo Planning, ICAPS'09, 2009.

A. Couetoux, J. Hoock, N. Sokolovska, O. Teytaud, and N. Bonnard, Continuous Upper Confidence Trees, LION'11: Proceedings of the 5th International Conference on Learning and Intelligent OptimizatioN, p.page TBA, 2011.
DOI : 10.1016/0196-8858(85)90002-8
URL : https://hal.archives-ouvertes.fr/hal-00835352

R. Coulom, Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
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.
URL : https://hal.archives-ouvertes.fr/inria-00149859

H. Nakhost and M. Müller, Monte-carlo exploration for deterministic planning, IJCAI, pp.1766-1771, 2009.

P. Rolet, M. Sebag, and O. Teytaud, Optimal active learning through billiards and upper confidence trees in continous domains, Proceedings of the ECML conference, 2009.

Y. Wang, J. Audibert, and R. Munos, Algorithms for infinitely many-armed bandits, Advances in Neural Information Processing Systems, 2008.