The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Evolution, neural networks, games, and intelligence
Abstract
Mathematical games provide a framework for studying intelligent behavior in models of real-world settings or restricted domains. The obstacle comes in choosing the appropriate representation and learning algorithm. Neural networks and evolutionary algorithms provide useful means for addressing these issues. This paper describes efforts to hybridize neural and evolutionary computation to learn appropriate strategies in zero- and nonzero-sum games, including the iterated prisoner's dilemma, tic-tac-toe, and checkers. With respect to checkers, the evolutionary algorithm was able to discover a neural network that can be used to play at a near-expert level without injecting expert knowledge about how to play the game. The implications of evolutionary learning with respect to machine intelligence are also discussed. It is argued that evolution provides the framework for explaining naturally occurring intelligent entities and can be used to design machines that are also capable of intelligent behavior.
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
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290 · cited 1×
“The recognition of evolution as an intelligent learning process has been offered many times ([38], [39] and others).”
BackgroundRational cooperation in the finitely repeated prisoners' dilemma
Kreps, D. M., Milgrom, P., Roberts, J., & Wilson, R. (1982) · Journal of Economic Theory · doi:10.1016/0022-0531(82)90029-1 · Cited by 2,494
Cited by
Automatic design and manufacture of robotic lifeforms
Lipson, H., & Pollack, J. B. (2000) · Nature · doi:10.1038/35023115 · Cited by 883
Metadata
- Authors
- Chellapilla, K., & Fogel, D. B.
- Venue
- Proceedings of the IEEE
- Published
- 1999
- Volume
- 87
- Issue
- 9
- Pages
- 1471-1496
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2170588376
- Cited by
- 193
- References
- 2
- FWCI
- 10.99
- 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.