Trade-Offs in Sampling-Based Adversarial Planning


  • Raghuram Ramanujan Cornell University
  • Bart Selman Cornell University



The Upper Confidence bounds for Trees (UCT) algorithm has in recent years captured the attention of the planning and game-playing community due to its notable success in the game of Go. However, attempts to reproduce similar levels of performance in domains that are the forte of Minimax-style algorithms have been largely unsuccessful, making any comparative studies of the two hard. In this paper, we study UCT in the game of Mancala, which to our knowledge is the first domain where both search algorithms perform quite well with minimal enhancement. We focus on the three key components of the UCT algorithm in its purest form - targeted node expansion, state value estimation via playouts and averaging backups - and look at their contributions to the overall performance of the algorithm. We study the trade-offs involved in using alternate ways to perform these steps. Finally, we demonstrate a novel hybrid approach to enhancing UCT, that exploits its superior decision accuracy in regions of the search space with few terminal nodes.




How to Cite

Ramanujan, R., & Selman, B. (2011). Trade-Offs in Sampling-Based Adversarial Planning. Proceedings of the International Conference on Automated Planning and Scheduling, 21(1), 202-209.