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
Efficient 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
Monte-Carlo Planning in Large POMDPs
Silver, D., & Veness, J. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 886
Self-citationCombining 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
On-line policy improvement using Monte-Carlo search
Tesauro, G., & Galperin, G. R. (2025) · arXiv · doi:10.48550/arxiv.2501.05407 · Cited by 209
Computer Go: An AI oriented survey
Bouzy, B., & Cazenave, T. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00127-8 · Cited by 205
Müller, M. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00121-7 · Cited by 177
Fuego—An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search
Enzenberger, M., Muller, M., Arneson, B., & Segal, R. (2010) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2010.2083662 · Cited by 174
UCT for tactical assault planning in real-time strategy games
Balla, R.-K., & Fern, A. (2009) · Cited by 158
Expected-outcome: a general model of static evaluation
Abramson, B. D. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.44404 · Cited by 154
Temporal Difference Learning of Position Evaluation in the Game of Go
Schraudolph, N. N., Dayan, P., & B, T. J. S. A. (1993) · UCL Discovery (University College London) · Cited by 143
Modifications of UCT and sequence-like simulations for Monte-Carlo Go
Wang, Y., & Gelly, S. (2007) · IEEE Conference on Computational Intelligence and Games (CIG) · doi:10.1109/cig.2007.368095 · Cited by 130
Self-citationBouzy, B., & Helmstetter, B. (2004) · Advances in Computer Games · doi:10.1007/978-0-387-35706-5_11 · Cited by 129
Sheppard, B. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00166-7 · Cited by 123
Reinforcement learning of local shape in the game of go
Silver, D., Sutton, R. S., & Müller, M. (2007) · UCL Discovery (University College London) · Cited by 122
Self-citationAchieving master level play in 9×9 computer go
Gelly, S., & Silver, D. (2008) · UCL Discovery (University College London) · Cited by 121
Self-citationSample-based learning and search with permanent and transient memories
Silver, D., Sutton, R. S., & Müller, M. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390278 · Cited by 109
Self-citationLorentz, R. J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87608-3_2 · Cited by 107
Monte-Carlo simulation balancing
Silver, D., & Tesauro, G. J. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553495 · Cited by 96
Self-citationAn Analysis of UCT in Multi-player Games
Sturtevant, N. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87608-3_4 · Cited by 87
Feature Selection as a One-Player Game
Gaudel, R., & Sébag, M. (2010) · Cited by 86
Using probabilistic knowledge and simulation to play poker
Billings, D., Peña‐Castillo, L., Schaeffer, J., et al. (1999) · Cited by 72
Associating domain-dependent knowledge and Monte Carlo approaches within a Go program
Bouzy, B. (2004) · Information Sciences · doi:10.1016/j.ins.2004.04.010 · Cited by 69
The games computers (and people) play
Schaeffer, J. (2000) · Advances in computers · doi:10.1016/s0065-2458(00)80019-4 · Cited by 64
Creating an Upper-Confidence-Tree Program for Havannah
Teytaud, F., & Teytaud, O. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12993-3_7 · Cited by 55
Machines that learn to play games
Fürnkranz, J., & Kubát, M. (2001) · Nova Science Publishers eBooks · Cited by 53
Monte-Carlo Simulation Balancing in Practice
Huang, S.-C., Coulom, R., & Lin, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-17928-0_8 · Cited by 52
Reinforcement Learning and Simulation-Based Search in Computer Go
Silver, D. (2009) · doi:10.7939/r39d8t · Cited by 46
Self-citationEvaluation in Go by a Neural Network Using Soft Segmentation
Enzenberger, M. (2004) · Advances in Computer Games · doi:10.1007/978-0-387-35706-5_7 · Cited by 40
Evaluation Function Based Monte-Carlo LOA
Winands, M. H. M., & Björnsson, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12993-3_4 · Cited by 39
On the Parallelization of Monte-Carlo planning
Gelly, S., Hoock, J., Rimmel, A., Teytaud, O., & Kalemkarian, Y. (2008) · Cited by 36
Self-citationHayward, R. (2012) · ICGA Journal · doi:10.3233/icg-2012-35212 · Cited by 34
Honte, a go-playing program using neural nets
Dahl, F. A. (2001) · Cited by 32
Move-Pruning Techniques for Monte-Carlo Go
Bouzy, B. (2006) · Lecture notes in computer science · doi:10.1007/11922155_8 · Cited by 24
Introduction of a new paraphrase generation tool based on Monte-Carlo sampling
Chevelu, J., Lavergne, T., Lepage, Y., & Moudenc, T. (2009) · Joint Conference of the Annual Meeting of the Association for Computational Linguistics and the International Joint Conference on Natural Language Processing (ACL-IJCNLP) · doi:10.3115/1667583.1667660 · Cited by 21
MECHNER, D. A. (1998) · The Sciences · doi:10.1002/j.2326-1951.1998.tb03356.x · Cited by 19
Combining Online and Offline Learning in UCT
Gelly, S., & Silver, D. (2007) · Cited by 18
Self-citationMACHINES THAT LEARN TO PLAY GAMES
Hartmann, D. (2002) · ICGA Journal · doi:10.3233/icg-2002-25206 · Cited by 10
Arneson, B., Hayward, R., & Henderson, P. (2010) · ICGA Journal · doi:10.3233/icg-2010-33316 · Cited by 9
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
Building 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
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
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.