Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 695

The DOI matches its Crossref record.

Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress

Samuel, A. L.·1967·IBM Journal of Research and Development

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1147/rd.116.0601

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 695

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
0
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress. https://app.cochat.ai/papers/10.1147/rd.116.0601
The paper
Samuel, A. L. (1967). Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress. IBM Journal of Research and Development. https://doi.org/10.1147/rd.116.0601

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.