Instantiating General Games Using Prolog or Dependency Graphs

Peter Kissmann, Stefan Edelkamp

Abstract: This paper proposes two ways to instantiate general games specified in the game description language GDL to enhance exploration efficiencies of existing players. One uses Prolog’s inference mechanism to find supersets of reachable atoms and moves; the other one utilizes dependency graphs, a datastructure that can calculate the dependencies of the arguments of predicates by evaluating the various formulas from the game’s description.