Monte-Carlo simulation balancing in practice

DOI10.1007/978-3-642-17928-0_8zbMATH Open1316.68138OpenAlexW2128020951MaRDI QIDQ3073741FDOQ3073741

Authors: Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin 

Publication date: 11 February 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-17928-0_8

Recommendations

• Analyzing simulations in Monte-Carlo tree search for the game of Go
• Adaptive playouts for online learning of policies during Monte Carlo tree search
• Using evaluation functions in Monte-Carlo tree search
• Anomalies of pure Monte-Carlo search in Monte-Carlo perfect games
• Amazons Discover Monte-Carlo

zbMATH Keywords

computer Go

Mathematics Subject Classification ID

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

Cited In (6)

• Monte Carlo methods beyond detailed balance
• Analyzing simulations in Monte-Carlo tree search for the game of Go
• Adaptive playouts for online learning of policies during Monte Carlo tree search
• Playout policy adaptation with move features
• Note on Monte Carlo methods without necessary detailed balance.
• Sampling from a neural network

This page was built for publication: Monte-Carlo simulation balancing in practice

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