Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

CG
2010
Springer

favoriteEmaildiscussreport

176views Computer Graphics» more CG 2010»

Biasing Monte-Carlo Simulations through RAVE Values

13 years 9 months ago

Biasing Monte-Carlo Simulations through RAVE Values

Download hal.inria.fr

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, we propose a generic way of improving the Monte-Carlo simulations by using RAVE values, which already strongly improved the tree part of the algorithm. We prove the generality and efficiency of our approach by showing improvements on two different applications: the game of Havannah and the game of Go.

Arpad Rimmel, Fabien Teytaud, Olivier Teytaud

Real-time Traffic

CG 2010 | Computer Graphics | Monte-Carlo | Monte-Carlo Simulations | Monte-Carlo Tree Search |

claim paper

Related Content

» Haplotype association analyses in resources of mixed structure using Monte Carlo testing

» SimulationBased Optimization Using Simulated Annealing With Confidence Interval

» Estimating tranche spreads by loss process simulation

» An improved Akaike information criterion for statespace model selection

» Assessing solution quality in stochastic programs

» Nonparametric Obstruction Detection for UWB Localization

» NLOS identification and mitigation for localization based on UWB experimental data

» Optimum bias for fastswitching free energy calculations

» Partitioning Nominal Attributes in Decision Trees

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	CG
Authors	Arpad Rimmel, Fabien Teytaud, Olivier Teytaud

Comments (0)