The Dangers of Random Playouts

With recent advances in Monte Carlo approaches to move planning in computer games – in particular Monte Carlo Tree Search (MCTS) proposed by Coulomb (2006) – more attention is now being paid to simulationbased methods such as the use of random playouts to estimate the utility of given board positions. The general assumption is that the accuracy of these estimates will increase with the number of simulations; we present a simple counterexample that demonstrates that this is not always the case.

[1]  Cameron Browne,et al.  Automatic generation and evaluation of recombination games , 2008 .

[2]  Olivier Teytaud,et al.  On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms , 2010, Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games.

[3]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.