Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms
<|reference_start|>Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms: Monte Carlo Tree Search and Monte Carlo Search have good results for many combinatorial problems. In this paper we propose to use Monte Carlo Search to design mathematical expressions that are used as exploration terms for Monte Carlo Tree Search algorithms. The optimized Monte Carlo Tree Search algorithms are PUCT and SHUSS. We automatically design the PUCT and the SHUSS root exploration terms. For small search budgets of 32 evaluations the discovered root exploration terms make both algorithms competitive with usual PUCT.<|reference_end|>
@article{cazenave2024monte,
    title={Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search
  Exploration Terms},
    author={Tristan Cazenave},
    journal={arXiv preprint arXiv:2404.09304},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.09304},
    primaryClass={cs.AI}
}