TL;DR
This paper introduces the inductive general game playing (IGGP) problem, creating a dataset from diverse games to evaluate how well current ILP systems can learn game rules from traces, highlighting significant challenges.
Contribution
The paper presents a new IGGP dataset derived from GGP games and demonstrates that existing ILP systems struggle to learn rules, establishing a benchmark for future research.
Findings
Most ILP systems fail to learn game rules accurately.
The best system solves only 40% of tasks perfectly.
IGGP presents significant challenges for current ILP approaches.
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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
