More Trees or Larger Trees: Parallelizing Monte Carlo Tree Search

Autor:	E. S. Steinmetz, Maria Gini
Rok vydání:	2021
Předmět:	Computer science Monte Carlo method Monte Carlo tree search Backpropagation Domain (software engineering) Instruction set Tree (data structure) Artificial Intelligence Control and Systems Engineering Electrical and Electronic Engineering Extended time Computer Go Algorithm Software
Zdroj:	IEEE Transactions on Games. 13:315-320
ISSN:	2475-1510 2475-1502
Popis:	Monte Carlo tree search (MCTS) is being effectively used in many domains, but acquiring good results from building larger trees takes time that can in many cases be impractical. In this article, we show that parallelizing the tree building process using multiple independent trees (root parallelization) can improve results when limited time is available, and compare these results to other parallelization techniques and to results obtained from running for an extended time. We obtained our results using MCTS in the domain of computer Go, which has the most mature implementations. Compared to previous studies, our results are more precise and statistically significant.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c3f1a774bae7649d4bc81d432f7979fe https://doi.org/10.1109/tg.2020.3048331 Zobrazit plný text záznamu