Expected-outcome: a general model of static evaluation
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The expected-outcome model, in which the proper evaluation of a game-tree node is the expected value of the game's outcome given random play from that node on, is proposed. Expected outcome is considered in its ideal form, where it is shown to be a powerful heuristic. The ability of a simple random sampler that estimates expected outcome to outduel a standard Othello evaluator is demonstrated. The sampler is combined with a linear regression procedure to produce efficient expected-outcome estimators. Overall, the expected-outcome model of two-player games is shown to be precise, accurate, easily estimable, efficiently calculable, and domain-independent.>
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
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457
Cited by
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 Section 3, the MCTS algorithm and its key components are described in detail.”
MethodEfficient 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
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
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC*
Bertsekas, D. P. (2005) · European Journal of Control · doi:10.3166/ejc.11.310-334 · Cited by 366
The 2017 IEEE International Conference on Fuzzy Systems
(2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2016.2545826 · Cited by 308
Strategy Generation and Evaluation for Meta-Game Playing
Pell, B. (2011) · KI - Künstliche Intelligenz · doi:10.1007/s13218-010-0082-7 · Cited by 73
“A related technique, which can also be viewed as a form of selfplay, is that of Abramson [Abramson, 1990], who developed basic playing programs which learned to predict the expected-outcome of positions if played by random players.”
BackgroundMethodInfluentialA 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
Metadata
- Authors
- Abramson, B.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1990
- Volume
- 12
- Issue
- 2
- Pages
- 182-193
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2107549951
- Cited by
- 130
- References
- 2
- FWCI
- 2.77
- 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.