IEEE Transactions on Computational Intelligence and AI in Games · 2010 · 143 citations · 16 references
ComputingComputer ScienceAlgorithmsArtificial IntelligenceGame TheoryAlgorithmic Game TheoryHeuristic SearchMonte Carlo MethodsMonte Carlo SimulationNash EquilibriumStochastic GamesAlpha-beta PruningArtificial Intelligence In GamesComputational Game TheoryMonte Carlo SamplingMonte Carlo Tree SearchSearch HeuristicsTree SearchTree Search Algorithms
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of AI research since Claude Shannon's seminal work in the 1950s. Until the Monte Carlo Go revolution a few years ago, the best computer Hex players used knowledge-intensive alpha-beta search. Since that time, strong Monte Carlo Hex players have appeared that are on par with the best alpha-beta Hex players. In this paper, we describe MoHex, the Monte Carlo tree search Hex player that won gold at the 2009 Computer Olympiad. Our main contributions to Monte Carlo tree search include using inferior cell analysis and connection strategy computation to prune the search tree. In particular, we run our random game simulations not on the actual game position, but on a reduced equivalent board.
16
Winning Ways for Your Mathematical Plays.
R. J. Connelly, Elwyn R. Berlekamp, John H. Conway et al. · American Mathematical Monthly · 1986 · 1.5K citations
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