A Lock-free Algorithm for Parallel MCTS

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

Abstract

In this paper, we present a new lock-free tree data structure for parallelMonte Carlo tree search (MCTS) which removes synchronization overhead and guarantees the consistency of computation. It is based on the use of atomic operations and the associated memory ordering guarantees. The proposed parallel algorithm scales very well to higher numbers of cores when compared to the existing methods.

References

Download


Paper Citation


in Harvard Style

Mirsoleimani S., van den Herik J., Plaat A. and Vermaseren J. (2018). A Lock-free Algorithm for Parallel MCTS.In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-275-2, pages 589-598. DOI: 10.5220/0006653505890598


in Bibtex Style

@conference{icaart18,
author={S. Ali Mirsoleimani and Jaap van den Herik and Aske Plaat and Jos Vermaseren},
title={A Lock-free Algorithm for Parallel MCTS},
booktitle={Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2018},
pages={589-598},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006653505890598},
isbn={978-989-758-275-2},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - A Lock-free Algorithm for Parallel MCTS
SN - 978-989-758-275-2
AU - Mirsoleimani S.
AU - van den Herik J.
AU - Plaat A.
AU - Vermaseren J.
PY - 2018
SP - 589
EP - 598
DO - 10.5220/0006653505890598