Methods › Reinforcement Learning › Heuristic Search Algorithms › Monte-Carlo Tree Search

Monte-Carlo Tree Search

introduced 2006 166 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Monte-Carlo Tree Search is a planning algorithm that accumulates value estimates obtained from Monte Carlo simulations in order to successively direct simulations towards more highly-rewarded trajectories. We execute MCTS after encountering each new state to select an agent's action for that state: it is executed again to select the action for the next state. Each execution is an iterative process that simulates many trajectories starting from the current state to the terminal state. The core idea is to successively focus multiple simulations starting at the current state by extending the initial portions of trajectories that have received high evaluations from earlier simulations.

Source: Sutton and Barto, Reinforcement Learning (2nd Edition)

Image Credit: Chaslot et al

In Syntology for a different name, 'Monte Carlo tree search': repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'Monte Carlo tree search' (resolution: token_match); this answer is about that name. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2010.12069) is about this method is not checked.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:2010.12069 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 166 · with a code link: 62 · where Syntology ran a sample: 12 (10 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (12 of 166 tagged: 10 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 166, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 111 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Reinforcement Learning (RL)47
reinforcement-learning45
Reinforcement Learning44
Model-based Reinforcement Learning21
Decision Making20
Board Games16
Deep Reinforcement Learning14
Atari Games12
Continuous Control6
Game of Go6
continuous-control5
model5
Sequential Decision Making4
Atari Games 100k3
BIG-bench Machine Learning3
Bayesian Optimization3
Computational Efficiency3
General Reinforcement Learning3
Heuristic Search3
Machine Translation3

Usage over time archive 2025-07-28

Papers per year tagged with Monte-Carlo Tree Search: 2009 to 2025, peak 29 29 0 2009: 1 paper 2009 2010: 2 papers 2011: 0 papers 2011 2012: 0 papers 2013: 2 papers 2013 2014: 1 paper 2015: 1 paper 2015 2016: 0 papers 2017: 2 papers 2017 2018: 8 papers 2019: 13 papers 2019 2020: 29 papers 2021: 24 papers 2021 2022: 21 papers 2023: 28 papers 2023 2024: 23 papers 2025: 11 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (166 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Heuristic Search Algorithms

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections