Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2205.00451 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910483724894208 |
|---|---|
| author | Soemers, Dennis J. N. J. Piette, Éric Stephenson, Matthew Browne, Cameron |
| author_facet | Soemers, Dennis J. N. J. Piette, Éric Stephenson, Matthew Browne, Cameron |
| contents | There are several different game description languages (GDLs), each intended to allow wide ranges of arbitrary games (i.e., general games) to be described in a single higher-level language than general-purpose programming languages. Games described in such formats can subsequently be presented as challenges for automated general game playing agents, which are expected to be capable of playing any arbitrary game described in such a language without prior knowledge about the games to be played. The language used by the Ludii general game system was previously shown to be capable of representing equivalent games for any arbitrary, finite, deterministic, fully observable extensive-form game. In this paper, we prove its universality by extending this to include finite non-deterministic and imperfect-information games. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_00451 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | The Ludii Game Description Language is Universal Soemers, Dennis J. N. J. Piette, Éric Stephenson, Matthew Browne, Cameron Artificial Intelligence Computer Science and Game Theory There are several different game description languages (GDLs), each intended to allow wide ranges of arbitrary games (i.e., general games) to be described in a single higher-level language than general-purpose programming languages. Games described in such formats can subsequently be presented as challenges for automated general game playing agents, which are expected to be capable of playing any arbitrary game described in such a language without prior knowledge about the games to be played. The language used by the Ludii general game system was previously shown to be capable of representing equivalent games for any arbitrary, finite, deterministic, fully observable extensive-form game. In this paper, we prove its universality by extending this to include finite non-deterministic and imperfect-information games. |
| title | The Ludii Game Description Language is Universal |
| topic | Artificial Intelligence Computer Science and Game Theory |
| url | https://arxiv.org/abs/2205.00451 |