Score bounded Monte-Carlo tree search

DOI10.1007/978-3-642-17928-0_9MaRDI QIDQ3073742zbMATH OpenOpenAlexFDO

Authors Tristan Cazenave, Abdallah Saffidine

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_9

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

• Monte-Carlo Tree Search Solver
• Using evaluation functions in Monte-Carlo tree search
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• Investigating the limits of Monte-Carlo tree search methods in computer Go
• On Monte-Carlo tree search for deterministic games with alternate moves and complete information

Cited in

(4)

• Using evaluation functions in Monte-Carlo tree search
• Monte-Carlo Tree Search Solver
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• Partial order bounding: A new approach to evaluation in game tree search

Describes a project that uses

Uses Software

• MCTS-Solver

This page was built for publication: Score bounded Monte-Carlo tree search

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