Principles of artificial intelligence
Principles of artificial intelligence
Computer Go: an AI oriented survey
Artificial Intelligence
Games, puzzles, and computation
Games, puzzles, and computation
Parallel Monte-Carlo Tree Search
CG '08 Proceedings of the 6th international conference on Computers and Games
On the scalability of parallel UCT
CG'10 Proceedings of the 7th international conference on Computers and games
Scalability and parallelization of Monte-Carlo tree search
CG'10 Proceedings of the 7th international conference on Computers and games
Bandit based monte-carlo planning
ECML'06 Proceedings of the 17th European conference on Machine Learning
A lock-free multithreaded monte-carlo tree search algorithm
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
Hi-index | 0.00 |
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.