PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
From MaRDI portal
Publication:5506116
DOI10.1142/S1793005708001094zbMath1198.68225WikidataQ56573220 ScholiaQ56573220MaRDI QIDQ5506116
Jos W. H. M. Uiterwijk, H. Jaap van den Herik, Mark H. M. Winands, Guillaume M. J.-B. Chaslot
Publication date: 28 January 2009
Published in: New Mathematics and Natural Computation (Search for Journal in Brave)
Monte Carlo methods (65C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46)
Related Items (17)
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 ⋮ Using evaluation functions in Monte-Carlo tree search ⋮ Scalable Online Planning for Multi-Agent MDPs ⋮ Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search ⋮ MoHex 2.0: A Pattern-Based MCTS Hex Player ⋮ Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information ⋮ Amazons Discover Monte-Carlo ⋮ Monte-Carlo Tree Search Solver ⋮ Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search ⋮ A game-based approximate verification of deep neural networks with provable guarantees ⋮ On Monte-Carlo tree search for deterministic games with alternate moves and complete information ⋮ Reasoning about uncertain parameters and agent behaviors through encoded experiences and belief planning ⋮ Multi-armed bandits with episode context ⋮ Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis ⋮ Unnamed Item ⋮ Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Cites Work
This page was built for publication: PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
