Towards generating arcade game rules with VGDL
- Thorbjørn Nielsen,
- Gabriella A B Barros,
- Julian Togelius,
- Mark Nelson
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewPublication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 185 - 192 (8 pages)Publication milestones
- Published - 2015
Publication status
Published - 2015
Publisher
IEEE, United StatesISBN (Print)
978-1-4799-8621-7Publication IDs
- Scopus: 84964425156
Host publication title
2015 IEEE Conference on Computational Intelligence and Games (CIG)Abstract
We describe an attempt to generate complete arcade
games using the Video Game Description Language (VGDL)
and the General Video Game Playing environment (GVG-AI).
Games are generated by an evolutionary algorithm working on
genotypes represented as VGDL descriptions. In order to direct
evolution towards good games, we need an evaluation function
that accurately estimates game quality. The evaluation function
used here is based on the differential performance of several
game-playing algorithms, or Relative Algorithm Performance
Profiles (RAPP): it is assumed that good games allow good
players to play better than bad players. For the purpose of such
evaluations, we introduce two new game tree search algorithms,
DeepSearch and Explorer; these perform very well on benchmark
games and constitute a substantial subsidiary contribution of the
paper. In the end, the attempt to generate arcade games is only
partially successful, as some of the games have interesting design
features but are barely playable as generated. An analysis of these
shortcomings yields several suggestions to guide future attempts
at arcade game generation
games using the Video Game Description Language (VGDL)
and the General Video Game Playing environment (GVG-AI).
Games are generated by an evolutionary algorithm working on
genotypes represented as VGDL descriptions. In order to direct
evolution towards good games, we need an evaluation function
that accurately estimates game quality. The evaluation function
used here is based on the differential performance of several
game-playing algorithms, or Relative Algorithm Performance
Profiles (RAPP): it is assumed that good games allow good
players to play better than bad players. For the purpose of such
evaluations, we introduce two new game tree search algorithms,
DeepSearch and Explorer; these perform very well on benchmark
games and constitute a substantial subsidiary contribution of the
paper. In the end, the attempt to generate arcade games is only
partially successful, as some of the games have interesting design
features but are barely playable as generated. An analysis of these
shortcomings yields several suggestions to guide future attempts
at arcade game generation
Publication metrics
PlumX, opens in new tab
Citations
44
Captures
42
Access to documents
Related Event
Title
2015 IEEE Conference on Computational Intelligence and Games
Event type
ConferenceDate
31/08/2015 - 02/09/2015Location
Tayih Landis HotelTainanTaiwan, Province of China
