ICGA Journal · 2009 · 36 citations · 7 references
ComputingComputer ScienceAlgorithmsGame TheoryAlgorithmic Game TheoryGame PlayingMonte Carlo MethodsMonte Carlo SimulationReinforcement LearningStochastic GamesComputer GoGame Tree SearchGame TreesMonte Carlo Tree SearchTree Search
The dominant paradigm for computer-Go players is Monte-Carlo Tree Search (MCTS). This algorithm builds a search tree by playing many simulated games (playouts ). Each playout consists of a sequence of moves within the tree followed by many moves beyo
7
Reinforcement Learning: An Introduction
IEEE Transactions on Neural Networks · 2005 · 25.8K citations
Artificial intelligence: a modern approach
Choice Reviews Online · 1995 · 22.2K citations · Full text
Combining online and offline knowledge in UCT
Sylvain Gelly, David Silver · 2007 · 458 citations · Full text
COMPUTING “ELO RATINGS” OF MOVE PATTERNS IN THE GAME OF GO1
Rémi Coulom · ICGA Journal · 2007 · 300 citations · Full text
Modification of UCT with Patterns in Monte-Carlo Go
Sylvain Gelly, Yizao Wang, Rémi Munos et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2006 · 295 citations · Full text