Adaptive playouts for online learning of policies during Monte Carlo tree search

DOI10.1016/J.TCS.2016.06.029zbMATH Open1370.68260OpenAlexW2468569233MaRDI QIDQ307776FDOQ307776

Authors: Tobias Graf, Marco Platzner 

Publication date: 5 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.029

Recommendations

• Playout policy adaptation with move features
• On Monte Carlo tree search and reinforcement learning
• Using evaluation functions in Monte-Carlo tree search
• Analyzing simulations in Monte-Carlo tree search for the game of Go
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH

zbMATH Keywords

reinforcement learningMonte Carlo tree searchcomputer Goadaptive playouts

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46)

Cites Work

• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• Using deep convolutional neural networks in Monte Carlo tree search
• Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search
• Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go
• Monte-Carlo simulation balancing in practice
• Variance reduction techniques for gradient estimates in reinforcement learning
• Algorithms for reinforcement learning.
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH

Cited In (1)

• Monte-Carlo simulation balancing in practice

Uses Software

• PACHI

This page was built for publication: Adaptive playouts for online learning of policies during Monte Carlo tree search

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