Scalability and parallelization of Monte-Carlo tree search

DOI10.1007/978-3-642-17928-0_5MaRDI QIDQ3073736zbMATH OpenOpenAlexFDO

Authors Amine Bourki, Guillaume M. J.-B. Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Jean-Baptiste Hoock, Thomas Herault, Arpad Rimmel, Fabien Teytaud, Paul Vayssière, Ziqin Yu, 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

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

Recommendations

• On the scalability of parallel UCT
• Investigating the limits of Monte-Carlo tree search methods in computer Go
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• Using evaluation functions in Monte-Carlo tree search
• A Parallel Game Tree Search Algorithm With A Linear Speedup

Cited in

(7)

• A Parallel Game Tree Search Algorithm With A Linear Speedup
• Improving Monte-Carlo tree search in Havannah
• The scalability analysis of a parallel tree search algorithm
• The scalability analysis of a parallel tree search algorithm
• On the scalability of parallel UCT
• Efficiency of static knowledge bias in Monte-Carlo tree search
• scientific article; zbMATH DE number 7233958 (Why is no real title available?)

This page was built for publication: Scalability and parallelization of Monte-Carlo tree search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073736)