Monte Carlo Tree Search
Monte Carlo Tree Search (MCTS) is a decision-making algorithm that builds a search tree by simulating possible future outcomes, balancing exploration and exploitation to find optimal actions. Current research focuses on enhancing MCTS's efficiency and applicability in diverse domains, including quantum computing, mathematical reasoning, and autonomous agent control, often integrating it with large language models and reinforcement learning. These advancements are significantly impacting fields like AI planning, game playing, and robotics by enabling more efficient and effective decision-making in complex, uncertain environments.
Papers
Amplifying Exploration in Monte-Carlo Tree Search by Focusing on the Unknown
Cedric Derstroff, Jannis Brugger, Jannis Blüml, Mira Mezini, Stefan Kramer, Kristian Kersting
VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large Language Model, and Tree Search
David Brandfonbrener, Simon Henniger, Sibi Raja, Tarun Prasad, Chloe Loughridge, Federico Cassano, Sabrina Ruixin Hu, Jianang Yang, William E. Byrd, Robert Zinkov, Nada Amin
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis
Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel Day, Florin Manea, Vijay Ganesh
Checkmating One, by Using Many: Combining Mixture of Experts with MCTS to Improve in Chess
Felix Helfenstein, Jannis Blüml, Johannes Czech, Kristian Kersting
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
Piyush Jha, Zhengyu Li, Zhengyang Lu, Curtis Bright, Vijay Ganesh
Discovering Mathematical Formulas from Data via GPT-guided Monte Carlo Tree Search
Yanjie Li, Weijun Li, Lina Yu, Min Wu, Jingyi Liu, Wenqiang Li, Meilan Hao, Shu Wei, Yusong Deng