Scalability and Parallelization of Monte-Carlo Tree Search

DOI10.1007/978-3-642-17928-0_5zbMath1316.68134OpenAlexW1524244278MaRDI QIDQ3073736

Fabien Teytaud, Thomas Hérault, Vincent Danjean, Guillaume M. J.-B. Chaslot, Paul Vayssière, Hassen Doghmen, Matthieu Coulm, Ziqin Yu, Jean-Baptiste Hoock, Amine Bourki, Arpad Rimmel, Olivier Teytaud

Publication date: 11 February 2011

Published in: Computers and Games (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00512854/file/newcluster.pdf

zbMATH Keywords

computer Go

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46) Experimental studies (91A90)

This page was built for publication: Scalability and Parallelization of Monte-Carlo Tree Search