Sciweavers

843 search results - page 3 / 169
» Monte-Carlo Go Developments
Sort
View
ICAI
2007
13 years 7 months ago
Heuristics in Monte Carlo Go
Peter Drake, Steve Uurtamo
CEC
2007
IEEE
14 years 18 days ago
Experiments with Monte Carlo Othello
— In this paper, we report on our experiments with using Monte Carlo simulation (specifically the UCT algorithm) as the basis for an Othello playing program. Monte Carlo methods ...
Philip Hingston, Martin Masek
ICGA
2008
208views Optimization» more  ICGA 2008»
13 years 6 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
CG
2008
Springer
13 years 8 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...