Biasing Monte-Carlo Simulations through RAVE Values

被引:0
|
作者
Rimmel, Arpad [1 ]
Teytaud, Fabien [2 ]
Teytaud, Olivier [2 ]
机构
[1] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2M7, Canada
[2] CNRS, LRI, UMR 8623, TAO Inria, F-91405 Orsay, France
来源
COMPUTERS AND GAMES | 2011年 / 6515卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:59 / +
页数:3
相关论文
共 50 条