Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 220 of the 233 references it cites were found in a registry or an index.

A Survey of Monte Carlo Tree Search Methods

Browne, Cameron B., Powley, Edward, Whitehouse, Daniel, Lucas, Simon M., Cowling, Peter I., Rohlfshagen, Philipp, Tavener, Stephen, Perez, Diego, Samothrakis, Spyridon, Colton, Simon · 2012 · IEEE Transactions on Computational Intelligence and AI in Games

Abstract

Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tciaig.2012.2186810

Cites

220 of 220 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 233 references

Research works printed but not linked: 35

  1. Entries marked with an asterisk (*) denote support material that does not directly cite MCTS methods
  2. Althöfer, 2010, “Game self-play with pure Monte-Carlo: The basin structure
  3. Asmuth, Approaching Bayes-optimalilty using Monte-Carlo tree search
  4. Borsboom, A comparison of Monte-Carlo methods for phantom Go, 57
  5. Brügmann, 1993, Monte Carlo Go
  6. Cazenave, 2007, Evolving Monte-Carlo tree search algorithms
  7. Chaslot, 2008, Combining expert, offline, transient and online knowledge in Monte-Carlo exploration
  8. Den Teuling, 2011, Monte-Carlo tree search for the simultaneous move game Tron
  9. Drake, Move ordering vs heavy playouts: Where should heuristics be applied in Monte Carlo Go, 35
  10. 10.17875/gup2010-1477 · doi:10.17875/gup2010-1477
  11. 10.1109/tciaig.2010.2083662 · DOI · Paper page
  12. Finnsson, Simulation control in general game playing agents, 21
  13. Gelly, 2007, A contribution to reinforcement learning; Application to computer-Go
  14. Huang, 2011, New heuristics for Monte Carlo tree search applied to the Game of Go
  15. Könnecke, 2009, Efficient playouts for the Havannah abstract board game
  16. Lopez, 2008, Rybka’s Monte Carlo analysis
  17. 10.3233/978-1-58603-891-5-458 · doi:10.3233/978-1-58603-891-5-458
  18. 10.65109/vilr5324 · doi:10.65109/vilr5324
  19. 10.1163/1573-3912_ei2glos_sim_gi_00259 · doi:10.1163/1573-3912_ei2glos_sim_gi_00259
  20. Méhat, 2008, Monte-Carlo tree search for general game playing
  21. Nguyen, 2011, ICE gUCT
  22. Nijssen, 2007, Playing Othello using Monte Carlo, Strategies, 1
  23. Nijssen, 2009, Using intelligent search techniques to play the game Khet
  24. Ramanujan, On the behavior of UCT in synthetic search spaces
  25. Rosin, Nested rollout policy adaptation for Monte Carlo tree search, 649
  26. Saffidine, 2008, Utilisation dUCT au Hex
  27. Saffidine, 2010, Some improvements for Monte-Carlo tree search, game description language compilation, score bounds and transpositions
  28. Schadd, 2009, Monte-Carlo search techniques in the modern board game Thurn and Taxis
  29. Schaefers, UCT-treesplit-parallel MCTS on distributed memory
  30. Schäfer, 2008, The UCT algorithm applied to games with imperfect information
  31. Shafiei, Comparing UCT versus CFR in simultaneous games
  32. Stankiewicz, 2011, Knowledge-based Monte-Carlo tree search in Havannah
  33. Sylvester, A linear classifier outperforms UCT in 9$\,\times\,$9 Go, 804
  34. Williams, 2010, Determining game quality through UCT tree shape analysis
  35. 10.1109/tciaig.2010.2061050 · DOI

Cited by

See all 2,970

Metadata

Authors
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S.
Affiliations
  • Imperial College London (GB)
  • University of Bradford (GB)
  • University of Essex (GB)
Venue
IEEE Transactions on Computational Intelligence and AI in Games
Published
2012-03
Volume
4
Issue
1
Pages
1-43
ISSN
  • 1943-068X (ISSN-L)
  • 1943-0698
OpenAlex
W2126316555
Cited by
2,970
References
233
Citations by year
2026: 163 · 2025: 220 · 2024: 244 · 2023: 269 · 2022: 294 · 2021: 308 · 2020: 305 · 2019: 263 · 2018: 230 · 2017: 186 · 2016: 155 · 2015: 117 · 2014: 125 · 2013: 60 · 2012: 28
FWCI
103.94
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Computational Intelligence and AI in Games (publishedVersion)
  • Research Publications (Maastricht University) (publishedVersion)
  • Open Access at Essex (University of Essex) (acceptedVersion)
  • Research Publications (Maastricht University) (submittedVersion, public-domain)
Funders
Engineering and Physical Sciences Research Council (EP/H048588/1, EP/H049061/2, EP/H049061/1, EP/I001964/1)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
Keywords
Monte Carlo tree search, computer Go, search algorithms, random sampling, game-playing agents, open research questions

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Survey of Monte Carlo Tree Search Methods. https://app.cochat.ai/papers/10.1109/tciaig.2012.2186810
The paper
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S. (2012). A Survey of Monte Carlo Tree Search Methods. IEEE Transactions on Computational Intelligence and AI in Games. https://doi.org/10.1109/tciaig.2012.2186810

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.