Scalability and Parallelization of Monte-Carlo Tree Search
From MaRDI portal
Publication:3073736
DOI10.1007/978-3-642-17928-0_5zbMath1316.68134MaRDI 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
68W10: Parallel algorithms in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
91A46: Combinatorial games
91A90: Experimental studies