Array-Based Monte Carlo Tree Search
By: James Ragan, Fred Y. Hadaegh, Soon-Jo Chung
Potential Business Impact:
Makes computer games think and play faster.
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.
Similar Papers
Parallelizing Tree Search with Twice Sequential Monte Carlo
Machine Learning (CS)
Makes AI learn faster and better.
Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees
Machine Learning (CS)
Makes smart programs avoid dangerous bad choices.
Gaussian Process Aggregation for Root-Parallel Monte Carlo Tree Search with Continuous Actions
Artificial Intelligence
Helps robots learn faster by guessing good moves.