arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.04447cs.DC
收藏

A New Method for Parallel Monte Carlo Tree Search

S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren

英文摘要:

In recent years there has been much interest in the Monte Carlo tree search algorithm, a new, adaptive, randomized optimization algorithm. In fields as diverse as Artificial Intelligence, Operations Research, and High Energy Physics, research has established that Monte Carlo tree search can find good solutions without domain dependent heuristics. However, practice shows that reaching high performance on large parallel machines is not so successful as expected. This paper proposes a new method for parallel Monte Carlo tree search based on the pipeline computation pattern.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑