The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Searching for solutions in games and artificial intelligence
Open accessAbstract
VII vm CONTENTS 2.4.3Tournament programs 2.4.4The algorithms compared 2.4.5 Comparing the performances 2.4.6 Test positions 2.4.7 Results 2.4.8 Conclusions 2.5 Related algorithms 2.5.1 Conspiracy-number search 2.5.2SSS* 2.5.3B* 2.5.4A* 3 Dependency-Based Search • i V> *^ CONTENTS GO? 6.3.5 Awari «20 i 6.3.6 Othello tii i :. £1 6.3.7 Checkers s : 6.3.8Draughts 169 *; 6.3.9Chess 6.3.10Chinese chess •'-'.6.3.11Renju 6.3.12Go 6.3.13Scrabble 6.3.14Backgammon 6.3.15Bridge 6.4 Reviewing the problem statement 6.4.1 The research questions 6.4.2The problem statement 6.5 Predictions . . . . .' 6.5.1 Future playing strength 6.5.2The future of games A Domain-specific solution to DLP 185
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
The Theory of Games and Economic Behavior
Harrison, R. W., von Neumann, J., & Morgenstern, O. (1945) · Journal of Farm Economics · doi:10.2307/1232672 · Cited by 5,133
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
Some studies in machine learning using the game of checkers
Samuel, A. L. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0206 · Cited by 1,439
Machine learning: An artificial intelligence approach
Hunt, E. (1983) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(83)90037-8 · Cited by 1,349
Brook, C. V., & de Groot, A. D. (1966) · The American Journal of Psychology · doi:10.2307/1421155 · Cited by 1,284
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
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
Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress
Samuel, A. L. (1967) · IBM Journal of Research and Development · doi:10.1147/rd.116.0601 · Cited by 695
Artificial intelligence—A personal view
Marr, D. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90013-3 · Cited by 502
The B∗ tree search algorithm: A best-first proof procedure
Berliner, H. (1979) · Artificial Intelligence · doi:10.1016/0004-3702(79)90003-1 · Cited by 188
Machine learning: An artificial intelligence approach (vol. 2)
Hunt, E. (1987) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(87)90031-9 · Cited by 178
Retrograde Analysis of Certain Endgames
Thompson, K. (1986) · ICGA Journal · doi:10.3233/icg-1986-9302 · Cited by 173
A world championship caliber checkers program
Schaeffer, J., Culberson, J., Treloar, N., Knight, B., Lu, P., & Szafron, D. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90074-8 · Cited by 161
Greenblatt, R. D., Eastlake, D. E., & Crocker, S. D. (1967) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1465611.1465715 · Cited by 129
A Knowledge-Based Approach of Connect-Four: The Game Is Solved: White Wins
Allis, V. (1988) · ICGA Journal · doi:10.3233/icg-1988-11410 · Cited by 126
A comparison of minimax tree search algorithms
Campbell, M. S., & Marsland, T. A. (1983) · Artificial Intelligence · doi:10.1016/0004-3702(83)90001-2 · Cited by 113
GO‐MOKU SOLVED BY NEW SEARCH TECHNIQUES
Alus, L. V., van den Herik, H. J., & Huntjens, M. P. H. (1996) · Computational Intelligence · doi:10.1111/j.1467-8640.1996.tb00250.x · Cited by 83
Backgammon Computer Program Beats World Champion
Berliner, H. (1988) · Springer eBooks · doi:10.1007/978-1-4613-8716-9_2 · Cited by 65
Backgammon computer program beats world champion
Berliner, H. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90041-7 · Cited by 50
Games with Imperfect Information
Blair, J. R. S., Mutchler, D., & Liu, C. (2014) · The MIT Press eBooks · doi:10.7551/mitpress/9674.003.0007 · Cited by 21
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
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
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
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
Dota 2 with Large Scale Deep Reinforcement Learning
OpenAI, :, Berner, C., Brockman, G., Chan, B., Cheung, V., Dębiak, P., Dennison, C., Farhi, D., Fischer, Q., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.06680 · Cited by 1,065
Metadata
- Authors
- Allis, L. V.
- Publisher
- University of Maastricht
- Published
- 1994-01-01
- OpenAlex
- W1512315140
- Cited by
- 347
- References
- 22
- Type
- dissertation
- Language
- en
- Open access
- gold
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.