Pruning playouts in Monte Carlo tree search for the game of Havannah

DOI10.1007/978-3-319-50935-8_5zbMATH Open1398.91121OpenAlexW2559788100MaRDI QIDQ1989573FDOQ1989573

Authors: Joris Duguépéroux, Ahmad Mazyad, Fabien Teytaud, Julien Dehos 

Publication date: 26 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-50935-8_5

Recommendations

• Improving Monte-Carlo tree search in Havannah
• Biasing Monte-Carlo simulations through RAVE values
• Using evaluation functions in Monte-Carlo tree search
• Enhancements for multi-player Monte-Carlo tree search
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Combinatorial games (91A46)

Cited In (6)

• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
• Playout policy adaptation with move features
• Biasing Monte-Carlo simulations through RAVE values
• Improving Monte-Carlo tree search in Havannah
• Enhancements for multi-player Monte-Carlo tree search
• Multi-cut \(\alpha \beta\)-pruning in game-tree search

This page was built for publication: Pruning playouts in Monte Carlo tree search for the game of Havannah

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