Using evaluation functions in Monte-Carlo tree search

DOI10.1016/J.TCS.2016.06.026zbMATH Open1370.68264OpenAlexW2461132327MaRDI QIDQ307789FDOQ307789

Authors: Richard J. Lorentz 

Publication date: 5 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.026

Recommendations

• MCTS-minimax hybrids with state evaluations
• Amazons Discover Monte-Carlo
• Monte-Carlo Tree Search Solver
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• Score bounded Monte-Carlo tree search

zbMATH Keywords

AmazonsBreakthroughHavannahMCTSMCTS-EPT

Mathematics Subject Classification ID

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

Cites Work

• Amazons Discover Monte-Carlo
• An analysis of alpha-beta pruning
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• An evaluation function for the game of amazons

Cited In (12)

• Monte-Carlo Tree Search Solver
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• Monte-Carlo simulation balancing in practice
• Improving Monte-Carlo tree search in Havannah
• Computational experiments with the RAVE heuristic
• Enhancements for multi-player Monte-Carlo tree search
• Scalability and parallelization of Monte-Carlo tree search
• Score bounded Monte-Carlo tree search
• Node-expansion operators for the UCT algorithm
• Monte-Carlo opening books for Amazons
• Amazons Discover Monte-Carlo

This page was built for publication: Using evaluation functions in Monte-Carlo tree search

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