The dangers of random playouts

ICGA Journal

Volumn 34, Issue 1, 2011, Pages 25-26

  Browne, Cameron ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79960548644     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/ICG-2011-34105     Document Type: Article

References (4)

1. Coulom, R. (2006). Efficient Backup and Selectivity Operators in Monte-Carlo Tree Search, Computers and Games 2006 (eds. H.J. van den Herik, P. Ciancarini, and H.H.L.M. Donkers), Vol. 4630 LNCS, pp. 72-83, Springer, Heidelberg, Germany.
2. Kocsis, L. and Szepesvári, C. (2006). Bandit based Monte-Carlo Planning, (eds. J. Fürnkranz, T. Scheffer, and M. Spiliopoulou), Machine Learning: ECML 2006, LNCS 4212, pp. 282-293, Springer, Heidelberg, Germany.
3. Browne, C. (2008). Automatic Generation and Evaluation of Recombination Games, Ph.D. Thesis, Faculty of Information Technology, Queensland University of Technology, Brisbane, Australia.
4. Teytaud, F. and Teytaud, O. (2010). On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms, Computational Intelligence, Vol. 1, No. 1, pp. 359-364.