Monte-carlo tree search parallelisation for computer go

F Van Niekerk, GJ van Rooyen, S Kroon… - Proceedings of the South …, 2012 - dl.acm.org
Proceedings of the South African Institute for Computer Scientists and …, 2012dl.acm.org
Parallelisation of computationally expensive algorithms, such as Monte-Carlo Tree Search
(MCTS), has become increasingly important in order to increase algorithm performance by
making use of commonplace parallel hardware. Oakfoam, an MCTS-based Computer Go
player, was extended to support parallel processing on multi-core and cluster systems. This
was done using tree parallelisation for multi-core systems and root parallelisation for cluster
systems. Multi-core parallelisation scaled linearly on the tested hardware on 9x9 and 19x19 …
Parallelisation of computationally expensive algorithms, such as Monte-Carlo Tree Search (MCTS), has become increasingly important in order to increase algorithm performance by making use of commonplace parallel hardware.
Oakfoam, an MCTS-based Computer Go player, was extended to support parallel processing on multi-core and cluster systems. This was done using tree parallelisation for multi-core systems and root parallelisation for cluster systems.
Multi-core parallelisation scaled linearly on the tested hardware on 9x9 and 19x19 boards when using the virtual loss modification. Cluster parallelisation showed poor results on 9x9 boards, but scaled well on 19x19 boards, where it achieved a four-node ideal strength increase on eight nodes.
Due to this work, Oakfoam is currently one of only two open-source MCTS-based Computer Go players with cluster parallelisation, and the only one using the Message Passing Interface (MPI) standard.
ACM Digital Library
以上显示的是最相近的搜索结果。 查看全部搜索结果

Google学术搜索按钮

example.edu/paper.pdf
搜索
获取 PDF 文件
引用
References