Efficiency of GDL Reasoners
The variety of open-source game description language (GDL) reasoners available to newcomers to general game playing (GGP) lowers the technical barrier of entering the field. This variety, however, also makes it more complicated to decide on a fitting reasoner for a given GGP project, considering the...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on computational intelligence and AI in games. 2014-12, Vol.6 (4), p.343-354 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The variety of open-source game description language (GDL) reasoners available to newcomers to general game playing (GGP) lowers the technical barrier of entering the field. This variety, however, also makes it more complicated to decide on a fitting reasoner for a given GGP project, considering the project's objectives, ambitions, and technical constraints. This paper gives an overview of available GDL reasoners, discusses their main pros and cons, and, most importantly, quantifies their relative reasoning performance on a number of games (in terms of nodes searched per second), showing two orders of magnitude difference in some cases. We similarly quantify the performance difference between game playing systems specifically designed for playing a single game on the one hand, and GGP systems on the other hand, witnessing up to several orders of magnitude difference. |
---|---|
ISSN: | 1943-068X 2475-1502 1943-0698 2475-1510 |
DOI: | 10.1109/TCIAIG.2014.2308362 |