Computational experiments with the RAVE heuristic

DOI10.1007/978-3-642-17928-0_7MaRDI QIDQ3073738zbMATH OpenOpenAlexFDO

Authors

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_7

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)

Recommendations

• Biasing Monte-Carlo simulations through RAVE values
• Using evaluation functions in Monte-Carlo tree search
• Monte-Carlo Tree Search Solver
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• VOI-aware MCTS

Cited in

(3)

• Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
• scientific article; zbMATH DE number 1759719 (Why is no real title available?)
• Biasing Monte-Carlo simulations through RAVE values

This page was built for publication: Computational experiments with the RAVE heuristic

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