45 search results - page 2 / 9 » Cross-Entropy for Monte-Carlo Tree Search |
ACG
2009
Springer
14 years 3 days ago
2009
Springer
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...
TCIAIG
2010
13 years 6 days ago
2010
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 ...
CG
2006
Springer
13 years 9 months ago
2006
Springer
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
AIIDE
2008
13 years 7 months ago
2008
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
CG
2008
Springer
13 years 7 months ago
2008
Springer
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...