Progressive Strategies for Monte-Carlo Tree Search

Progressive Strategies for Monte-Carlo Tree Search

Cached

Download Links

by G. M. J. B. Chaslot , M. H. M. Win , B. Bouzy

Citations:

BibTeX

@MISC{Chaslot_progressivestrategies,
    author = {G. M. J. B. Chaslot and M. H. M. Win and B. Bouzy},
    title = {Progressive Strategies for Monte-Carlo Tree Search},
    year = {}
}

Bookmark

OpenURL

Abstract

Two-person zero-sum games with perfect information have been addressed by many AI researchers with great success for fifty years [van den Herik et

Citations

111	Bandit based Monte-Carlo planning - Kocsis, Szepesvári - 2006
68	Computer Go: An AI Oriented Survey - Bouzy, Cazenave - 2001
66	Efficient selectivity and backup operators in monte-carlo tree search - Coulom
47	Combining online and offline knowledge in UCT - Gelly, Silver - 2007
25	Bandit algorithms for tree search - Coquelin, Munos - 2007
23	Computing elo ratings of move patterns in the game of go - Coulom - 2007
20	Exploration exploitation in Go: UCT for Monte-Carlo Go - Gelly, Wang - 2006
16	Associating domain-dependent knowledge and Monte Carlo approaches within a go program”, Information Sciences 175:4 - Bouzy - 2005
14	Bayesian generation and integration of k-nearest-neighbor patterns for 19x19 Go - Bouzy, Chaslot - 2005
11	Monte-Carlo Go Developments - Bouzy, Helmstetter - 2003
11	Den Herik, “Monte-Carlo Strategies for Computer Go - Chaslot, Saito, et al. - 2006
10	Chaslot G., “Monte-Carlo Go reinforcement learning experiments - Bouzy - 2006
4	Monte-Carlo Tree Search in Production Management Problems - Chaslot, Jong, et al. - 2006
3	Playing the right atari - Cazenave