The DOI matches its Crossref record; 12 of the 14 references it cites were found in a registry or an index.
Temporal difference learning applied to game playing and the results of application to shogi
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“AlphaZero may compensate for the lower number of evaluations by using its deep neural network to focus much more selectively on the most promising variations (Fig. 4 provides an example from the match against Stockfish) - arguably a more 'human-like' approach to search, as originally proposed by Shannon ( 30 ).”
From A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play (2018) · cites this paper as [30]
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
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
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
Encyclopedia of Artificial Intelligence
(2009) · IGI Global eBooks · doi:10.4018/978-1-59904-849-9 · Cited by 1,396
TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play
Tesauro, G. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.215 · Cited by 787
KnightCap: A Chess Programm That Learns by Combining TD(lambda) with Game-Tree Search
Baxter, J., Tridgell, A., & Weaver, L. (1998) · International Conference on Machine Learning · Cited by 75
Null Move and Deep Search: Selective-search Heuristics for Obtuse Chess Programs
Donninger, C. (1993) · ICGA Journal · doi:10.3233/icg-1993-16304 · Cited by 58
Adaptive Pattern-Oriented Chess
Levinson, R., & Snyder, R. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50021-0 · Cited by 50
A unified theory of heuristic evaluation functions and its application to learning
Christensen, J., & Korf, R. E. (1986) · National Conference on Artificial Intelligence · Cited by 46
Learning Piece Values Using Temporal Differences
Beal, D. F., & Smith, M. C. (1997) · ICGA Journal · doi:10.3233/icg-1997-20302 · Cited by 36
Self-citationNatural Developments in Game Research: From CHESS to SHOGI to Go
Matsubara, H., Iida, H., & Grimbergen, R. (1996) · ICGA Journal · doi:10.3233/icg-1996-19208 · Cited by 32
Research works printed but not linked: 3
- D.F. Beal, Experiments with the Null Move, in: D.F. Beal (Ed.), Advances in Computer Chess 5, Elsevier, Amsterdam, 1989, pp. 65–79.
- Donninger, 1993, Null move and deep search, Internat. Comp. Chess Ass. J., 16, 137
- M. Mutz, Gnu Shogi, vol. 2, p. 3 (Available from many sources, including ftp://ftp.uni-passau.de/pub/local/shogi, 1994).
Cited by
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
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
“Beal and Smith applied temporal-difference learning to estimate the piece values in chess (7) and shogi (8), starting from random values and learning solely by self-play.”
BackgroundPreference-based reinforcement learning: a formal framework and a policy iteration algorithm
Fürnkranz, J., Hüllermeier, E., Cheng, W., & Park, S.-H. (2012) · Machine Learning · doi:10.1007/s10994-012-5313-8 · Cited by 186
Large-Scale Optimization for Evaluation Functions with Minimax Search
Hoki, K., & Kaneko, T. (2014) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4217 · Cited by 36
“The studies published so far have adjusted only piece values or a small part of the feature weights in the evaluation functions (Beal & Smith, 2001; Ugajin & Kotani, 2010).”
BackgroundInfluentialA Survey of Planning and Learning in Games
Duarte, F. F., Lau, N., Pereira, A., & Reis, L. P. (2020) · Applied Sciences · doi:10.3390/app10134529 · Cited by 44
“Examples of this include work in Shogi [286], KnightCap [13] and Meep [14] in chess, Logistello [11] in Othello, TD-Gammon [15] in backgammon, LS-VisionDraughts [81] in checkers, and AlphaGo [17] and [262] in Go.”
Method
Metadata
- Authors
- Beal, D. F., & Smith, M. C.
- Affiliations
- University of London (GB)
- Corresponding author
- Beal, Donald F.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2001-02
- Volume
- 252
- Issue
- 1-2
- Pages
- 105-119
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2000759616
- Cited by
- 14
- References
- 14
- Citations by year
- 2024: 1 · 2023: 1 · 2020: 1 · 2018: 1 · 2015: 1 · 2014: 3 · 2013: 1 · 2012: 4
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 4549 d)
- Locations
- Theoretical Computer Science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence Applications
- Keywords
- temporal difference learning, shogi, minimax search, game playing, self-play, evaluation function learning, search depth
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: Temporal difference learning applied to game playing and the results of application to shogi. https://app.cochat.ai/papers/10.1016/s0304-3975(00)00078-5
- The paper
- Beal, D. F., & Smith, M. C. (2001). Temporal difference learning applied to game playing and the results of application to shogi. Theoretical Computer Science. https://doi.org/10.1016/s0304-3975(00)00078-5
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.