Node-expansion operators for the UCT algorithm

DOI10.1007/978-3-642-17928-0_11zbMATH Open1316.68148OpenAlexW1608034255MaRDI QIDQ3073748FDOQ3073748

Authors: Takayuki Yajima, Tsuyoshi Hashimoto, Toshiki Matsui, Junichi Hashimoto, Kristian Toby Spoerer 

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_11

Recommendations

• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• VOI-aware MCTS
• Using evaluation functions in Monte-Carlo tree search
• Monte Carlo tree search with robust exploration
• MCTS-minimax hybrids with state evaluations

zbMATH Keywords

computer Go

Mathematics Subject Classification ID

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

Cited In (1)

• VOI-aware MCTS

Uses Software

• MCTS-Solver

This page was built for publication: Node-expansion operators for the UCT algorithm

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