A lock-free multithreaded monte-carlo tree search algorithm

Authors:
Markus Enzenberger;Martin Müller
Affiliations:
Department of Computing Science, University of Alberta;Department of Computing Science, University of Alberta
Venue:
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
Year:
2009

Citing 3
Cited 5

Parallel Monte-Carlo Tree Search

CG '08 Proceedings of the 6th international conference on Computers and Games
A Parallel Monte-Carlo Tree Search Algorithm

CG '08 Proceedings of the 6th international conference on Computers and Games
Efficient selectivity and backup operators in Monte-Carlo tree search

CG'06 Proceedings of the 5th international conference on Computers and games

Intelligent agents for the game of go

IEEE Computational Intelligence Magazine
On the scalability of parallel UCT

CG'10 Proceedings of the 7th international conference on Computers and games
Multi-agent Monte Carlo Go

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Parallel Monte-Carlo tree search for HPC systems

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Monte-Carlo tree search parallelisation for computer go

Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the search has become an important issue. We present a new lock-free parallel algorithm for Monte-Carlo tree search which takes advantage of the memory model of the IA-32 and Intel-64 CPU architectures and intentionally ignores rare faulty updates of node values. We show that this algorithm significantly improves the scalability of the Fuego Go program.