Representing and reasoning about the rules of general games with imperfect information

34Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

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. © 2014 AI Access Foundation.

Cite

CITATION STYLE

APA

Schiffel, S., & Thielscher, M. (2014). Representing and reasoning about the rules of general games with imperfect information. Journal of Artificial Intelligence Research, 49, 171–206. https://doi.org/10.1613/jair.4115

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free