The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress
Abstract
A new signature table technique is described together with an improved book learning procedure which is thought to be much superior to the linear polynomial method described earlier. Full use is made of the so called “alpha-beta” pruning and several forms of forward pruning to restrict the spread of the move tree and to permit the program to look ahead to a much greater depth than it otherwise could do. While still unable to outplay checker masters, the program's playing ability has been greatly improved.
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
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
Self-citationAn Algorithm for the Traveling Salesman Problem
Little, J. D. C., Murty, K. G., Sweeney, D. W., & Karel, C. (1963) · Operations Research · doi:10.1287/opre.11.6.972 · Cited by 1,058
Chess-Playing Programs and the Problem of Complexity
Newell, A., Shaw, J. C., & Simon, H. A. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.24.0320 · Cited by 321
Cited by
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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 general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2018) · Science · doi:10.1126/science.aar6404 · Cited by 3,562
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Learning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00011-o · Cited by 1,104
Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.01815 · Cited by 1,102
Recent Advances in Hierarchical Reinforcement Learning
Barto, A. G., & Mahadevan, S. (2003) · Discrete Event Dynamic Systems · doi:10.1023/a:1022140919877 · Cited by 1,024
Goguen, J. A. (1969) · Synthese · doi:10.1007/bf00485654 · Cited by 1,007
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
Practical issues in temporal difference learning
Tesauro, G. (1992) · Machine Learning · doi:10.1007/bf00992697 · Cited by 787
Decision trees and decision-making
Quinlan, J. R. (1990) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.52545 · Cited by 566
Learning with genetic algorithms: An overview
De Jong, K. (1988) · Machine Learning · doi:10.1007/bf00113894 · Cited by 542
Learning to trade via direct reinforcement
Moody, J., & Saffell, M. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.935097 · Cited by 535
Model-based Reinforcement Learning: A Survey
M. Moerland, T., Broekens, J., Plaat, A., & M. Jonker, C. (2023) · Foundations and Trends in Machine Learning · doi:10.1561/2200000086 · Cited by 524
Wind power forecasting based on daily wind speed data using machine learning algorithms
Demolli, H., Dokuz, A. S., Ecemis, A., & Gokcek, M. (2019) · Energy Conversion and Management · doi:10.1016/j.enconman.2019.111823 · Cited by 468
Palm, G. (1980) · Biological Cybernetics · doi:10.1007/bf00337019 · Cited by 438
On the capabilities of multilayer perceptrons
Baum, E. B. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90020-9 · Cited by 379
Associatron-A Model of Associative Memory
Nakano, K. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309133 · Cited by 369
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Searching for solutions in games and artificial intelligence
Allis, L. V. (2021) · doi:10.26481/dis.19940923la · Cited by 347
Recent Advances in Hierarchical Reinforcement Learning
Barto, A. G., & Mahadevan, S. (2003) · Discrete Event Dynamic Systems · doi:10.1023/a:1025696116075 · Cited by 317
Harnessing Artificial Intelligence Capabilities to Improve Cybersecurity
Zeadally, S., Adi, E., Baig, Z., & Khan, I. A. (2020) · IEEE Access · doi:10.1109/access.2020.2968045 · Cited by 316
The convergence of TD(?) for general ?
Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992701 · Cited by 275
Approximate policy iteration: a survey and some new methods
Bertsekas, D. P. (2011) · Journal of Control Theory and Applications · doi:10.1007/s11768-011-1005-3 · Cited by 273
Wang, R., Lehman, J., Rawal, A., Zhi, J., Li, Y., Clune, J., & Stanley, K. O. (2020) · arXiv · doi:10.48550/arxiv.2003.08536 · Cited by 53
A STRATEGIC METAGAME PLAYER FOR GENERAL CHESS‐LIKE GAMES
Pell, B. (1996) · Computational Intelligence · doi:10.1111/j.1467-8640.1996.tb00258.x · Cited by 42
Shelley: A Crowd-sourced Collaborative Horror Writer
Yanardag, P., Cebrian, M., & Rahwan, I. (2021) · Creativity and Cognition · doi:10.1145/3450741.3465251 · Cited by 20
Modern machine learning in thin film device development
Dobrynin, A., Khaydukov, Y., & Gubbins, M. (2026) · Chemical Physics Reviews · doi:10.1063/5.0231166
Metadata
- Authors
- Samuel, A. L.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1967-11
- Volume
- 11
- Issue
- 6
- Pages
- 601-617
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W2161608691
- Cited by
- 695
- References
- 3
- FWCI
- 11.52
- Type
- journal article
- Language
- en
- Open access
- closed
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.