Sciweavers

24 search results - page 1 / 5
» A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm
Sort
View
ACG
2009
Springer
14 years 5 months ago
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm
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 sear...
Markus Enzenberger, Martin Müller 0003
EVOW
2010
Springer
14 years 5 months ago
Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search
Monte Carlo Tree Search is a recent algorithm that achieves more and more successes in various domains. We propose an improvement of the Monte Carlo part of the algorithm by modify...
Arpad Rimmel, Fabien Teytaud
CG
2010
Springer
13 years 9 months ago
Score Bounded Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
Tristan Cazenave, Abdallah Saffidine
CG
2010
Springer
13 years 9 months ago
Biasing Monte-Carlo Simulations through RAVE Values
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
CG
2010
Springer
13 years 9 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...