Bachelor's Thesis: Implementation and Evaluation of a Golog-based General Game Player [completed]

Submitted by Jens Claßen on 16. March 2014 - 19:00

The aim in General Game Playing (GGP) is to create programs called agents that are able to play a yet unknown game after they are given the rules. These programs must thus be as intelligent and as independent as possible to solve problems on their own. A similar research field is represented by Golog and the Situation-Calculus that are well-studied languages and allow reasoning about dynamic domains and diversified sets of problems.

All agents must be able to reason about actions. Hence one approach is to use the Situation-Calculus and Golog to represent games and to express strategies in such games. By introducing Golog to GGP we allow results and methods from both areas to be applied in GGP and vice versa. Accordingly we present an exemplary Golog setup and how to realize it in order to build a General Game Player. For this purpose we discuss how one can overcome the difficulties of translating a formalized game description to its corresponding Golog representation and show how simulations of games can be utilized with methods from Programming by Demonstration (PbD) in order to dynamically develop and maintain executable game strategies during runtime.

We show that our proof of concept agent GologPlayer is able to play turn-based games, supports most Game Description Language (GDL) features and show that it is able to beat randomly playing agents with a success rate of about 70%.