Monte-Carlo Tree Search Solver

DOI10.1007/978-3-540-87608-3_3zbMath1171.91308OpenAlexW1603772156MaRDI QIDQ3601818

Yngvi Björnsson, Mark H. M. Winands, Jahn-Takeshi Saito

Publication date: 12 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87608-3_3

Mathematics Subject Classification ID

2-person games (91A05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Experimental studies (91A90)

Related Items

An analysis for strength improvement of an MCTS-based program playing Chinese dark chess ⋮ Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information ⋮ Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Uses Software

• MCTS-Solver

Cites Work

• Unnamed Item
• Proof-number search
• ENHANCED REALIZATION PROBABILITY SEARCH
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH

This page was built for publication: Monte-Carlo Tree Search Solver