PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH

DOI10.1142/S1793005708001094MaRDI QIDQ5506116zbMATH OpenWikidataFDO

Authors Guillaume M. J.-B. Chaslot, Mark H. M. Winands, H. J. van den Herik, Jos W. H. M. Uiterwijk

Publication date 28 January 2009

Published in New Mathematics and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793005708001094

zbMATH Keywords

\texttt{Mango}computer Goheuristic searchMonte-Carlo simulation

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46)

Recommendations

• Monte-Carlo Tree Search Solver
• Using evaluation functions in Monte-Carlo tree search
• Efficiency of static knowledge bias in Monte-Carlo tree search
• Investigating the limits of Monte-Carlo tree search methods in computer Go
• Score bounded Monte-Carlo tree search

Cites work

• Checkers is solved
• Computer Go: An AI oriented survey
• Deep Blue
• Games solved: Now and in the future

Cited in

(36)

• Using deep convolutional neural networks in Monte Carlo tree search
• Monte Carlo tree search with robust exploration
• Pruning playouts in Monte Carlo tree search for the game of Havannah
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
• On Monte Carlo tree search for weighted vertex coloring
• A game-based approximate verification of deep neural networks with provable guarantees
• Reasoning about uncertain parameters and agent behaviors through encoded experiences and belief planning
• Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis
• Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search
• Efficiency of static knowledge bias in Monte-Carlo tree search
• Investigating the limits of Monte-Carlo tree search methods in computer Go
• MoHex 2.0: a pattern-based MCTS hex player
• Combinatorial multi-armed bandits for real-time strategy games
• Scalability and parallelization of Monte-Carlo tree search
• Computational experiments with the RAVE heuristic
• Score bounded Monte-Carlo tree search
• Node-expansion operators for the UCT algorithm
• Adaptive playouts for online learning of policies during Monte Carlo tree search
• An analysis for strength improvement of an MCTS-based program playing Chinese dark chess
• A program for progressive chess
• Using evaluation functions in Monte-Carlo tree search
• VOI-aware MCTS
• Amazons Discover Monte-Carlo
• Monte-Carlo Tree Search Solver
• MCTS-minimax hybrids with state evaluations
• scientific article; zbMATH DE number 6860770 (Why is no real title available?)
• Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
• On Monte-Carlo tree search for deterministic games with alternate moves and complete information
• Nonasymptotic Analysis of Monte Carlo Tree Search
• Scalable Online Planning for Multi-Agent MDPs
• Optimistic Monte Carlo tree search with sampled information relaxation dual bounds
• HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO
• MONTE CARLO GO CAPTURING TACTIC SEARCH
• Artificial intelligence for games
• A dual GCN-MCTS framework for yield-aware scheduling in multistage manufacturing
• Multi-armed bandits with episode context

This page was built for publication: PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH

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