Monte Carlo Tree Search is a popular method for solving decision making problems. Faster implementations allow for more simulations within the same wall clock time, directly improving search performance. To this end, we present an alternative array-based implementation of the classic Upper Confidence bounds applied to Trees algorithm. Our method preserves the logic of the original algorithm, but eliminates the need for branch prediction, enabling faster performance on pipelined processors, and up to a factor of 2.8 times better scaling with search depth in our numerical simulations.
@article{arxiv.2508.20140,
title = {Array-Based Monte Carlo Tree Search},
author = {James Ragan and Fred Y. Hadaegh and Soon-Jo Chung},
journal= {arXiv preprint arXiv:2508.20140},
year = {2025}
}