1. Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3): 235–256.
2. Balla, R. & Fern, A. (2009). UCT for tactical assault planning in real-time strategy games. In: 21st International Joint Conference on Artificial Intelligence, 40–45, Pasadena, CA, USA, July 11-17, 2009, Morgan Kaufmann Publishers Inc.
3. Barriga, N. A., Stanescu, M., & Buro, M. (2017). Combining strategic learning with tactical search in real-time strategy games. In: Magerko, B. & Rowe, J.P. (eds), Proceedings of the Thirteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-17), 9–15, Little Cottonwood Canyon, Utah, USA., October 5-9, 2017, AAAI Press.
4. Browne, C., Powley, E. J., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Liebana, D. P., Samothrakis, S., & Colton, S. (2012). A survey of monte carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in Games, 4(1): 1–43.
5. Churchill, D. & Buro, M. (2013). Portfolio greedy search and simulation for large-scale combat in starcraft. In: 2013 IEEE Conference on Computational Inteligence in Games (CIG), 1–8, Niagara Falls, ON, Canada, August 11-13, 2013, IEEE.