Evolving Mario Levels in the Latent Space of a Deep Convolutional Generative Adversarial Network
- Vanessa Volz,
- Jacob Schrum,
- Jialin Liu,
- Simon M Lucas,
- Adam Smith,
- TU Dortmund University,
- Southwestern University,
- QMW University of London,
- University of California
Publikation:
Konference artikel i Proceeding eller bog/rapport kapitel
Konferencebidrag i proceedings
Peer-reviewOpen Access
Resume
Generative Adversarial Networks (GANs) are a machine learning
approach capable of generating novel example outputs across a
space of provided training examples. Procedural Content Generation
(PCG) of levels for video games could benefit from such models,
especially for games where there is a pre-existing corpus of levels
to emulate. This paper trains a GAN to generate levels for Super
Mario Bros using a level from the Video Game Level Corpus. The
approach successfully generates a variety of levels similar to one
in the original corpus, but is further improved by application of
the Covariance Matrix Adaptation Evolution Strategy (CMA-ES).
Specifically, various fitness functions are used to discover levels
within the latent space of the GAN that maximize desired properties.
Simple static properties are optimized, such as a given distribution
of tile types. Additionally, the champion A* agent from the 2009
Mario AI competition is used to assess whether a level is playable,
and how many jumping actions are required to beat it. These fitness
functions allow for the discovery of levels that exist within the
space of examples designed by experts, and also guide the search
towards levels that fulfill one or more specified objectives.
approach capable of generating novel example outputs across a
space of provided training examples. Procedural Content Generation
(PCG) of levels for video games could benefit from such models,
especially for games where there is a pre-existing corpus of levels
to emulate. This paper trains a GAN to generate levels for Super
Mario Bros using a level from the Video Game Level Corpus. The
approach successfully generates a variety of levels similar to one
in the original corpus, but is further improved by application of
the Covariance Matrix Adaptation Evolution Strategy (CMA-ES).
Specifically, various fitness functions are used to discover levels
within the latent space of the GAN that maximize desired properties.
Simple static properties are optimized, such as a given distribution
of tile types. Additionally, the champion A* agent from the 2009
Mario AI competition is used to assess whether a level is playable,
and how many jumping actions are required to beat it. These fitness
functions allow for the discovery of levels that exist within the
space of examples designed by experts, and also guide the search
towards levels that fulfill one or more specified objectives.
Publikation information
Produktionstype
Publikation:
Konference artikel i Proceeding eller bog/rapport kapitel
Konferencebidrag i proceedings
Peer-reviewUndertitel på værtspublikation
GECCO '18Originalsprog
Udefineret/UkendtSider fra-til (Antal sider)
Sider 221-228Publikationsmilepæle
- Udgivet - 2018
Publikationsstatus
Udgivet - 2018
Forlag
Association for Computing Machinery, USAISBN (Elektronisk)
978-1-4503-5618-3Publication IDs
- Scopus: 85050613631
Titel på værtspublikation
Proceedings of the Genetic and Evolutionary Computation ConferenceMetrikker
PlumX, åbner i en ny fane
Antal citationer
215
Hentninger
198
