Inductive general game playing

被引:13
|
作者
Cropper, Andrew [1 ]
Evans, Richard [2 ]
Law, Mark [2 ]
机构
[1] Univ Oxford, Oxford, England
[2] Imperial Coll London, London, England
关键词
Program induction; Program synthesis; Inductive logic programming; General game playing; ANSWER; COMPLEXITY; PROGRAMS; RULES;
D O I
10.1007/s10994-019-05843-w
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 toinductive 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 asSudoku,Sokoban, andCheckers. 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.
引用
收藏
页码:1393 / 1434
页数:42
相关论文
共 50 条
  • [1] Inductive general game playing
    Andrew Cropper
    Richard Evans
    Mark Law
    [J]. Machine Learning, 2020, 109 : 1393 - 1434
  • [2] General Game Playing with Ants
    Sharma, Shiven
    Kobti, Ziad
    Goodwin, Scott
    [J]. SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2008, 5361 : 381 - 390
  • [3] On the Complexity of General Game Playing
    Bonnet, Edouard
    Saffidine, Abdallah
    [J]. COMPUTER GAMES, CGW 2014, 2014, 504 : 90 - 104
  • [4] A General Approach of Game Description Decomposition for General Game Playing
    Hufschmitt, Aline
    Vittaut, Jean-Noel
    Mehat, Jean
    [J]. COMPUTER GAMES: 5TH WORKSHOP ON COMPUTER GAMES, CGW 2016, AND 5TH WORKSHOP ON GENERAL INTELLIGENCE IN GAME-PLAYING AGENTS, GIGA 2016, HELD IN CONJUNCTION WITH THE 25TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2016, NEW YORK, USA, JULY 9-10, 2016, 2017, 705 : 165 - 177
  • [5] General Language Evolution in General Game Playing
    Chitizadeh, Armin
    Thielscher, Michael
    [J]. AI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11320 : 51 - 64
  • [6] General game playing with imperfect information
    Schofield, Michael
    Thielscher, Michael
    [J]. Journal of Artificial Intelligence Research, 2019, 66 : 901 - 935
  • [7] Symmetry Detection in General Game Playing
    Schiffel, Stephan
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 980 - 985
  • [8] Virtual General Game Playing Agent
    Helgadottir, Hafdis Erla
    Jonsdottir, Svanhvit
    Sigurdsson, Andri Mar
    Schiffel, Stephan
    Vilhjalmsson, Hannes Hoegni
    [J]. INTELLIGENT VIRTUAL AGENTS, IVA 2016, 2016, 10011 : 464 - 469
  • [9] Gamer, a General Game Playing Agent
    Kissmann, Peter
    Edelkamp, Stefan
    [J]. KUNSTLICHE INTELLIGENZ, 2011, 25 (01): : 49 - 52
  • [10] General game playing with stochastic CSP
    Koriche, Frederic
    Lagrue, Sylvain
    Piette, Eric
    Tabary, Sebastien
    [J]. CONSTRAINTS, 2016, 21 (01) : 95 - 114