1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multi-armed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002)
2. Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte- Carlo tree search methods. IEEE TCIAIG 4(1), 1–43 (2012)
3. Cazenave, T.: Nested Monte-Carlo Search. In: IJCAI (2011)
4. LNCS;R Coulom,2007
5. Khorshid, M.M.: Solving multi-agent pathfinding problems in polynomial time using tree decomposition. Master’s thesis, University of Alberta (2011)