Sciweavers

146 search results - page 2 / 30
» Parallel Monte-Carlo Tree Search
Sort
View
ECAI
2010
Springer
13 years 5 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
EVOW
2010
Springer
13 years 11 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
TCIAIG
2010
12 years 11 months ago
Evaluating Root Parallelization in Go
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe
IPPS
2009
IEEE
13 years 11 months ago
Parallel Nested Monte-Carlo search
Abstract—We address the parallelization of a MonteCarlo search algorithm. On a cluster of 64 cores we obtain a speedup of 56 for the parallelization of Morpion Solitaire. An algo...
Tristan Cazenave, Nicolas Jouandeau
TCIAIG
2010
12 years 11 months ago
Monte Carlo Tree Search in Hex
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
Broderick Arneson, Ryan B. Hayward, Philip Henders...