The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Monte-Carlo tree search and rapid action value estimation in computer Go
Open accessOverview
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.
Integrity signals
Registry
Cites
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.
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
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Bandit Based Monte-Carlo Planning
Kocsis, L., & Szepesvári, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871842_29 · Cited by 2,855
Monte-Carlo Planning in Large POMDPs
Silver, D., & Veness, J. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,408
Self-citationEfficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Coulom, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75538-8_7 · Cited by 1,240
Combining online and offline knowledge in UCT
Gelly, S., & Silver, D. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273531 · Cited by 465
Self-citationPROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
CHASLOT, G. M. J.-B., WINANDS, M. H. M., HERIK, H. J. V. D., UITERWIJK, J. W. H. M., & BOUZY, B. (2008) · New Mathematics and Natural Computation · doi:10.1142/s1793005708001094 · Cited by 435
COMPUTING “ELO RATINGS” OF MOVE PATTERNS IN THE GAME OF GO1
Coulom, R. (2007) · ICGA Journal · doi:10.3233/icg-2007-30403 · Cited by 298
Modification of UCT with Patterns in Monte-Carlo Go
Gelly, S., Wang, Y., Munos, R., & Teytaud, O. (2006) · HAL · Cited by 290
Self-citationSimulation-based approach to general game playing
Finnsson, H., & Björnsson, Y. (2008) · Cited by 235
The history heuristic and alpha-beta search enhancements in practice
Schaeffer, J. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.42858 · Cited by 227
Cited by
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Self-citationMastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084
Self-citationA Survey of Monte Carlo Tree Search Methods
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2186810 · Cited by 2,970
“In addition, the use of transpositions allows information to be shared between these extra nodes where the state is unchanged.”
InfluentialBuilding machines that learn and think like people
Lake, B. M., Ullman, T. D., Tenenbaum, J. B., & Gershman, S. J. (2017) · Behavioral and Brain Sciences · doi:10.1017/s0140525x16001837 · Cited by 2,550
Building Machines That Learn and Think Like People
Lake, B. M., Ullman, T. D., Tenenbaum, J. B., & Gershman, S. J. (2016) · arXiv · doi:10.48550/arxiv.1604.00289 · Cited by 2,550
Artificial intelligence in drug discovery: recent advances and future perspectives
Jiménez-Luna, J., Grisoni, F., Weskamp, N., & Schneider, G. (2021) · Expert Opinion on Drug Discovery · doi:10.1080/17460441.2021.1909567 · Cited by 464
A Survey of Multi-Objective Sequential Decision-Making
Roijers, D. M., Vamplew, P., Whiteson, S., & Dazeley, R. (2013) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3987 · Cited by 461
“Such approaches, which have proven very successful, e.g., in the game of Go (Gelly & Silver, 2011), are increasingly popular for single-objective MDPs. Wang and Sebag (2013) propose a Monte Carlo tree search method for deterministic MOMDPs.”
Monte Carlo Tree Search: a review of recent modifications and applications
Świechowski, M., Godlewski, K., Sawicki, B., & Mańdziuk, J. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10228-y · Cited by 365
Human-Like Playtesting with Deep Learning
Gudmundsson, S. F., Eisen, P., Poromaa, E., Nodet, A., Purmonen, S., Kozakowski, B., Meurling, R., & Cao, L. (2018) · 2018 IEEE Conference on Computational Intelligence and Games (CIG) · doi:10.1109/cig.2018.8490442 · Cited by 90
Butz, M. V. (2021) · KI - Künstliche Intelligenz · doi:10.1007/s13218-021-00705-x · Cited by 42
Monte-Carlo Graph Search for AlphaZero
Czech, J., Korus, P., & Kersting, K. (2020) · arXiv · doi:10.48550/arxiv.2012.11045 · Cited by 3
Metadata
- Authors
- Gelly, S., & Silver, D.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2011-07
- Volume
- 175
- Issue
- 11
- Pages
- 1856-1875
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W1997840820
- Cited by
- 367
- References
- 45
- FWCI
- 23.36
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.