Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
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.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Reinforcement Learning: An Introduction
(1998) · Kybernetes · doi:10.1108/k.1998.27.9.1093.3 · Cited by 1,472
An analysis of alpha-beta pruning
Knuth, D. E., & Moore, R. W. (1975) · Artificial Intelligence · doi:10.1016/0004-3702(75)90019-3 · Cited by 1,004
Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization
Chen, C.-H., Lin, J., Yücesan, E., & Chick, S. E. (2000) · Discrete Event Dynamic Systems · doi:10.1023/a:1008349927281 · Cited by 739
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
Kearns, M., Mansour, Y., & Ng, A. Y. (2002) · Machine Learning · doi:10.1023/a:1017932429737 · Cited by 488
Searching for solutions in games and artificial intelligence
Allis, L. V. (2021) · doi:10.26481/dis.19940923la · Cited by 347
Computer Go: An AI oriented survey
Bouzy, B., & Cazenave, T. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00127-8 · Cited by 205
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Dean, T. (1999) · Cited by 186
van den Herik, H. J., & Iida, H. (1999) · ICGA Journal · doi:10.3233/icg-1999-22107 · Cited by 154
Programming backgammon using self-teaching neural nets
Tesauro, G. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00110-2 · Cited by 153
An Adaptive Sampling Algorithm for Solving Markov Decision Processes
Chang, H. S., Fu, M. C., Hu, J., & Marcus, S. I. (2005) · Operations Research · doi:10.1287/opre.1040.0145 · Cited by 139
Expected-outcome: a general model of static evaluation
Abramson, B. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.44404 · Cited by 130
Bouzy, B., & Helmstetter, B. (2004) · Advances in Computer Games · doi:10.1007/978-0-387-35706-5_11 · Cited by 129
Monte Carlo planning in RTS games
Chung, M. (2005) · doi:10.7939/r3-1zkx-hg14 · Cited by 111
Tromp, J., & Farnebäck, G. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75538-8_8 · Cited by 95
Proceedings of the 16th European Conference on Artificial Intelligence
de Mántaras, R. L., & Saitta, L. (2004) · Cited by 90
A Bayesian approach to relevance in game playing
Baum, E. B., & Smith, W. D. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00059-3 · Cited by 52
Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games
Barone, L. (2007) · UWA Profiles and Research Repository (University of Western Australia) · Cited by 51
Evaluation 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
Move-Pruning Techniques for Monte-Carlo Go
Bouzy, B. (2006) · Lecture notes in computer science · doi:10.1007/11922155_8 · Cited by 24
Using Selective-Sampling Simulations in Poker
Billings, D., Papp, D., Castillo, L. P., et al. (1999) · Cited by 19
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
Mastering 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
A 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
“Real-world games typically involve a delayed reward structure in which only those rewards achieved in the terminal states of the game accurately describe how well each player is performing.”
BackgroundPlanning chemical syntheses with deep neural networks and symbolic AI
Segler, M. H. S., Preuss, M., & Waller, M. P. (2018) · Nature · doi:10.1038/nature25978 · Cited by 1,847
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
Metadata
- Authors
- Coulom, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- Pages
- 72-83
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1714211023
- Cited by
- 1,240
- References
- 25
- FWCI
- 24.50
- Type
- conference paper
- Language
- en
- Open access
- green
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.