Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games

被引：0
|
作者：
Althoefer, Ingo [1 ]
Turner, Wesley Michael [1 ]
机构：
[1] Univ Jena, Fac Math & Comp Sci, D-07743 Jena, Germany
来源：
COMPUTERS AND GAMES, CG 2013 | 2014年 / 8427卷
关键词：
D O I：
10.1007/978-3-319-09165-5_8
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A game is called "Monte-Carlo perfect" when in each position pure Monte-Carlo search converges to perfect play as the number of simulations tends toward infinity. We exhibit three families of Monte-Carlo perfect single-player and two-player games where this convergence is not monotonic. We for example give a class of MC-perfect games in which MC(1) performs arbitrarily well against MC(1,000).
引用
收藏
页码：84 / 99
页数：16
相关论文
共 50 条
12345