Biasing Monte-Carlo simulations through RAVE values

DOI10.1007/978-3-642-17928-0_6MaRDI QIDQ3073737zbMATH OpenOpenAlexFDO

Authors Arpad Rimmel, Fabien Teytaud, Olivier Teytaud

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_6

zbMATH Keywords

computer Go

Mathematics Subject Classification ID

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

Recommendations

• Computational experiments with the RAVE heuristic
• Pruning playouts in Monte Carlo tree search for the game of Havannah
• Towards generalizing the success of Monte-Carlo tree search beyond the game of Go
• Efficiency of static knowledge bias in Monte-Carlo tree search
• Analyzing simulations in Monte-Carlo tree search for the game of Go

Cited in

(3)

• Pruning playouts in Monte Carlo tree search for the game of Havannah
• Computational experiments with the RAVE heuristic
• Playout policy adaptation with move features

This page was built for publication: Biasing Monte-Carlo simulations through RAVE values

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