General Game Playing and the Game Description Language
Saffidine, Abdallah (2012), General Game Playing and the Game Description Language, Off the Beaten Track: Underrepresented Problems for Programming Language Researchers, 2012-01, Philadelphie, États-Unis
TypeCommunication / Conférence
Conference titleOff the Beaten Track: Underrepresented Problems for Programming Language Researchers
MetadataShow full item record
Abstract (EN)In Artiﬁcial Intelligence (AI), General Game Playing (GGP) consists in constructing artiﬁcial agents that are able to act rationally in previously unseen environments. Typically, an agent is presented with a description of a new environment and is requested to select an action among a given set of legal actions. Since the programmers do not have prior access to the description of the environment, they cannot encode domain speciﬁc knowledge in the agent, and the artiﬁcial agent must be able to infer, reason, and learn about its environment on its own. The class of environments an agent may face is called Multi-Agent Environments (MAEs), it features many interacting agents in a deterministic and discrete setting. The agents can take turns or act syn- chronously and can cooperate or have conﬂicting objectives. For instance, the Travelling Salesman Problem, Chess, the Prisoner’s Dilemma, and six-player Chinese Checkers all fall within the MAE framework. The environment is described to the agents in the Game Description Language (GDL), a declarative and rule based language, related to DATALOG. A state of the MAE corresponds to a set of ground terms and some distinguished predicates allow to compute the legal actions for each agents, the transition function through the effect of the actions, or the rewards each agent is awarded when a ﬁnal state has been reached. State of the art GGP players currently process GDL through a reduction to PROLOG and using a PROLOG interpreter. As a result, the raw speed of GGP engines is several order of magnitudes slower than that of an engine specialised to one type of environments (e.g. Chess). GGP is now an established research area and has been described as a Grand AI Challenge, but lack of high performance GDL compilers or interpreters is impeding further research development as it creates a high entry barrier for AI practitioners. Although GDL is based on DATALOG and PROLOG, it has many restricting hypotheses and additions over them and constitute an interesting challenge for Programming Language researchers. Particularly, its dynamic MAE semantics offer a complete new range of potential optimisations.
Subjects / KeywordsMulti-Agent Environments; Game Description Language; General game playing
Showing items related by title and author.