On the Complexity of General Game Playing

Author(s):  
Édouard Bonnet ◽  
Abdallah Saffidine
AI Magazine ◽  
2013 ◽  
Vol 34 (2) ◽  
pp. 107 ◽  
Author(s):  
Michael Genesereth ◽  
Yngvi Björnsson

Games have played a prominent role as a test-bed for advancements in the field of Artificial Intelligence ever since its foundation over half a century ago, resulting in highly specialized world-class game-playing systems being developed for various games. The establishment of the International General Game Playing Competition in 2005, however, resulted in a renewed interest in more general problem solving approaches to game playing. In general game playing (GGP) the goal is to create game-playing systems that autonomously learn how to skillfully play a wide variety of games, given only the descriptions of the game rules. In this paper we review the history of the competition, discuss progress made so far, and list outstanding research challenges.


2014 ◽  
Vol 26 (5) ◽  
pp. 1697-1727 ◽  
Author(s):  
Maciej Świechowski ◽  
Jacek Mańdziuk

2015 ◽  
Vol 2015 ◽  
pp. 1-22 ◽  
Author(s):  
Maciej Świechowski ◽  
HyunSoo Park ◽  
Jacek Mańdziuk ◽  
Kyung-Joong Kim

The goal of General Game Playing (GGP) has been to develop computer programs that can perform well across various game types. It is natural for human game players to transfer knowledge from games they already know how to play to other similar games. GGP research attempts to design systems that work well across different game types, including unknown new games. In this review, we present a survey of recent advances (2011 to 2014) in GGP for both traditional games and video games. It is notable that research on GGP has been expanding into modern video games. Monte-Carlo Tree Search and its enhancements have been the most influential techniques in GGP for both research domains. Additionally, international competitions have become important events that promote and increase GGP research. Recently, a video GGP competition was launched. In this survey, we review recent progress in the most challenging research areas of Artificial Intelligence (AI) related to universal game playing.


2014 ◽  
Vol 49 ◽  
pp. 171-206 ◽  
Author(s):  
S. Schiffel ◽  
M. Thielscher

A general game player is a system that can play previously unknown games just by being given their rules. For this purpose, the Game Description Language (GDL) has been developed as a high-level knowledge representation formalism to communicate game rules to players. In this paper, we address a fundamental limitation of state-of-the-art methods and systems for General Game Playing, namely, their being confined to deterministic games with complete information about the game state. We develop a simple yet expressive extension of standard GDL that allows for formalising the rules of arbitrary finite, n-player games with randomness and incomplete state knowledge. In the second part of the paper, we address the intricate reasoning challenge for general game-playing systems that comes with the new description language. We develop a full embedding of extended GDL into the Situation Calculus augmented by Scherl and Levesque's knowledge fluent. We formally prove that this provides a sound and complete reasoning method for players' knowledge about game states as well as about the knowledge of the other players.


Sign in / Sign up

Export Citation Format

Share Document