By the same authors

Monte Carlo Tree Search

Research output: Non-textual formSoftware

Author(s)

Department/unit(s)

Publication details

DatePublished - 2012
Original languageEnglish

Abstract

Monte Carlo Tree Search (MCTS) is a method for making optimal decisions in artificial intelligence (AI) problems, typically move planning in combinatorial games. It combines the generality of random simulation with the precision of tree search.
Research interest in MCTS has risen sharply due to its spectacular success with computer Go and potential application to a number of other difficult problems. Its application extends beyond games, and MCTS can theoretically be applied to any domain that can be described in terms of {state, action} pairs and simulation used to forecast outcomes.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations