Sciweavers

85 search results - page 9 / 17
» Heuristics in Monte Carlo Go
Sort
View
CEC
2010
IEEE
13 years 6 months ago
Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
Christian L. Müller, Ivo F. Sbalzarini
AAAI
2008
13 years 9 months ago
Simulation-Based Approach to General Game Playing
The aim of General Game Playing (GGP) is to create intelligent agents that automatically learn how to play many different games at an expert level without any human intervention. ...
Hilmar Finnsson, Yngvi Björnsson
TCIAIG
2010
13 years 2 months ago
Current Frontiers in Computer Go
This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best progr...
Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Sh...
ACG
2009
Springer
13 years 11 months ago
A Study of UCT and Its Enhancements in an Artificial Game
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
David Tom, Martin Müller
JMLR
2002
100views more  JMLR 2002»
13 years 7 months ago
On the Convergence of Optimistic Policy Iteration
We consider a finite-state Markov decision problem and establish the convergence of a special case of optimistic policy iteration that involves Monte Carlo estimation of Q-values,...
John N. Tsitsiklis