Inductive general game playing
Open accessThe DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
General game playing (GGP) is a framework for evaluating an agent’s general intelligence across a wide range of tasks. In the GGP competition, an agent is given the rules of a game (described as a logic program) that it has never seen before. The task is for the agent to play the game, thus generating game traces. The winner of the GGP competition is the agent that gets the best total score over all the games. In this paper, we invert this task: a learner is given game traces and the task is to learn the rules that could produce the traces. This problem is central to inductive general game playing(IGGP). We introduce a technique that automatically generates IGGP tasks from GGP games. We introduce an IGGP dataset which contains traces from 50 diverse games, such as Sudoku,Sokoban, and Checkers. We claim that IGGP is difficult for existing inductive logic programming (ILP) approaches. To support this claim, we evaluate existing ILP systems on our dataset. Our empirical results show that most of the games cannot be correctly learned by existing systems. The best performing system solves only 40% of the tasks perfectly. Our results suggest that IGGP poses many challenges to existing approaches. Furthermore, because we can automatically generate IGGP tasks from GGP games, our dataset will continue to grow with the GGP competition, as new games are added every year. We therefore think that the IGGP problem and dataset will be valuable for motivating and evaluating future research.
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
The Balanced Accuracy and Its Posterior Distribution
Brodersen, K. H., Ong, C. S., Stephan, K. E., & Buhmann, J. M. (2010) · 2010 20th International Conference on Pattern Recognition · doi:10.1109/icpr.2010.764 · Cited by 1,816 · cited 1×
“To account for this class imbalance, we use balanced accuracy [ 5 ] to evaluate the approaches.”
MethodLearning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Campbell, M., Hoane, A. J., & Hsu, F.-H. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00129-1 · Cited by 1,226
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
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 · cited 1×
“AlphaZero [ 69 ] has shown the power of combining tree search with a deep neural network for distilling search policy into a neural net.”
BackgroundDebnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00106a046 · Cited by 868
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Learning Explanatory Rules from Noisy Data
Evans, R., & Grefenstette, E. (2018) · Journal of Artificial Intelligence Research · doi:10.1613/jair.5714 · Cited by 426
Self-citationRelational Reinforcement Learning
Džeroski, S., De Raedt, L., & Driessens, K. (2001) · Machine Learning · doi:10.1023/a:1007694015589 · Cited by 371
Cited by
Learning programs by learning from failures
Cropper, A., & Morel, R. (2021) · Machine Learning · doi:10.1007/s10994-020-05934-z · Cited by 86
“However, these systems tend to learn overly specific solutions and struggle to learn recursive programs (Bratko 1999; Cropper et al. 2020).”
BackgroundMethodInfluentialSelf-citationInductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
“For instance, in inductive general game playing (Cropper et al., 2020b), the task is to learn the symbolic rules of games from observations of gameplay, such as learning the rules of connect four.”
BackgroundMethodInfluentialSelf-citationInductive logic programming at 30
Cropper, A., Dumančić, S., Evans, R., & Muggleton, S. H. (2022) · Machine Learning · doi:10.1007/s10994-021-06089-1 · Cited by 61
Self-citationEvans, R., Hernández-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2020.103438 · Cited by 58
Self-citationLogical reduction of metarules
Cropper, A., & Tourret, S. (2020) · Machine Learning · doi:10.1007/s10994-019-05834-x · Cited by 29
“2014, 2015) implementation, with different reduced sets of metarules and measure the resulting learning performance on three domains: Michalski trains (Larson and Michalski 1977), string transformations, and game rules (Cropper et al. 2019).”
BackgroundMethodSelf-citation
Metadata
- Authors
- Cropper, A., Evans, R., & Law, M.
- Venue
- Machine Learning
- Published
- 2019-11-18
- Volume
- 109
- Issue
- 7
- Pages
- 1393-1434
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2950021992
- Cited by
- 26
- References
- 19
- FWCI
- 1.96
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Inductive general game playing. https://app.cochat.ai/papers/10.1007/s10994-019-05843-w
- The paper
- Cropper, A., Evans, R., & Law, M. (2020). Inductive general game playing. Machine Learning. https://doi.org/10.1007/s10994-019-05843-w
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.