The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
COMPUTING “ELO RATINGS” OF MOVE PATTERNS IN THE GAME OF GO1
Open accessAbstract
Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This article presents a new Bayesian technique for supervised learning of such patterns from game records. The technique is based on a generalization of E
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
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
Self-citation(1978) · Medical Entomology and Zoology · Cited by 1,199
TrueSkill™: A Bayesian Skill Rating System
Herbrich, R., Minka, T., & Graepel, T. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0076 · Cited by 639
MM algorithms for generalized Bradley-Terry models
Hunter, D. R. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120141 · Cited by 467
PROGRESSIVE 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
Modification of UCT with Patterns in Monte-Carlo Go
Gelly, S., Wang, Y., Munos, R., & Teytaud, O. (2006) · HAL · Cited by 290
Bayesian pattern ranking for move prediction in the game of Go
Stern, D., Herbrich, R., & Graepel, T. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143954 · Cited by 78
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
van der Werf, E. C. D., UITERWIJK, J. W. H. M., Postma, E. O., & van den Herik, H. J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40031-8_26 · Cited by 34
Honte, a go-playing program using neural nets
Dahl, F. A. (2001) · Cited by 32
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
“In Sparse UCT, a node may have several children corresponding to the same move, each child corresponding to a different stochastic outcome of that move.”
BackgroundMethodInfluentialPlanning 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
PROGRESSIVE 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
Monte-Carlo tree search and rapid action value estimation in computer Go
Gelly, S., & Silver, D. (2011) · Artificial Intelligence · doi:10.1016/j.artint.2011.03.007 · Cited by 367
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
Pairwise ranking aggregation in a crowdsourced setting
Chen, X., Bennett, P. N., Collins-Thompson, K., & Horvitz, E. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433420 · Cited by 290
Accelerating scientific discovery with Co-Scientist
Gottweis, J., Weng, W.-H., Daryin, A., Tu, T., Sirkovic, P., Myaskovsky, A., Glowaty, G., Weissenberger, F., Orlandi, A., Popovici, D., et al. (2025) · arXiv · doi:10.48550/arxiv.2502.18864 · Cited by 158
“Despite its assumptions and limitations 32 , Elo remains a good proxy for relative ranking, and it has previously been applied to rank extracted patterns and ideas in games 33 .”
Penadés, J. R., Gottweis, J., He, L., Patkowski, J. B., Daryin, A., Weng, W.-H., Tu, T., Palepu, A., Myaskovsky, A., Pawlosky, A., et al. (2025) · Cell · doi:10.1016/j.cell.2025.08.018 · Cited by 42
A0C: Alpha Zero in Continuous Action Space
Moerland, T. M., Broekens, J., Plaat, A., & Jonker, C. M. (2018) · arXiv · doi:10.48550/arxiv.1805.09613 · Cited by 34
Olympiad-level formal mathematical reasoning with reinforcement learning
Hubert, T., Mehta, R., Sartran, L., Horváth, M. Z., Žužić, G., Wieser, E., Huang, A., Schrittwieser, J., Schroecker, Y., Masoom, H., et al. (2026) · Nature · doi:10.1038/s41586-025-09833-y · Cited by 19
“Furthermore, to manage the large, open-ended space of possible tactics, AlphaProof samples actions 18 and incorporates progressive sampling 19 to explore a broader range of proof strategies along critical paths (see Methods for full details on the network architecture and tree search algorithm).”
Metadata
- Authors
- Coulom, R.
- Venue
- ICGA Journal
- Publisher
- SAGE Publications
- Published
- 2007-12-01
- Volume
- 30
- Issue
- 4
- Pages
- 198-208
- ISSN
- 0920-234X (ISSN-L)
- 1389-6911
- 2468-2438
- OpenAlex
- W1500868819
- Cited by
- 298
- References
- 10
- FWCI
- 20.49
- Type
- journal article
- 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.