Generating and Blending Game Levels via Quality-Diversity in the Latent Space of a Variational Autoencoder

• URL: http://arxiv.org/abs/2102.12463v1
• Date: Wed, 24 Feb 2021 18:44:23 GMT
• Title: Generating and Blending Game Levels via Quality-Diversity in the Latent Space of a Variational Autoencoder
• Authors: Anurag Sarkar, Seth Cooper
• Abstract summary: We present a level generation and game blending approach that combines the use of VAEs and QD algorithms. Specifically, we train VAEs on game levels and then run the MAP-Elites QD algorithm using the learned latent space of the VAE as the search space.
• Score: 7.919213739992465
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Several recent works have demonstrated the use of variational autoencoders (VAEs) for both generating levels in the style of existing games as well as blending levels across different games. Additionally, quality-diversity (QD) algorithms have also become popular for generating varied game content by using evolution to explore a search space while focusing on both variety and quality. In order to reap the benefits of both these approaches, we present a level generation and game blending approach that combines the use of VAEs and QD algorithms. Specifically, we train VAEs on game levels and then run the MAP-Elites QD algorithm using the learned latent space of the VAE as the search space. The latent space captures the properties of the games whose levels we want to generate and blend, while MAP-Elites searches this latent space to find a diverse set of levels optimizing a given objective such as playability. We test our method using models for 5 different platformer games as well as a blended domain spanning 3 of these games. Our results show that using MAP-Elites in conjunction with VAEs enables the generation of a diverse set of playable levels not just for each individual game but also for the blended domain while illuminating game-specific regions of the blended latent space.

Related papers

• HybridGait: A Benchmark for Spatial-Temporal Cloth-Changing Gait Recognition with Hybrid Explorations [66.5809637340079]
  We propose the first in-the-wild benchmark CCGait for cloth-changing gait recognition. We exploit both temporal dynamics and the projected 2D information of 3D human meshes. Our contributions are twofold: we provide a challenging benchmark CCGait that captures realistic appearance changes across an expanded and space.
  arXiv  Detail & Related papers  (2023-12-30T16:12:13Z)
• On the Convergence of No-Regret Learning Dynamics in Time-Varying Games [89.96815099996132]
  We characterize the convergence of optimistic gradient descent (OGD) in time-varying games. Our framework yields sharp convergence bounds for the equilibrium gap of OGD in zero-sum games. We also provide new insights on dynamic regret guarantees in static games.
  arXiv  Detail & Related papers  (2023-01-26T17:25:45Z)
• Latent Combinational Game Design [4.8951183832371]
  We present an approach for generating playable games that blend a given set of games in a desired combination using deep generative latent variable models. Results show that these approaches can generate playable games that blend the input games in specified combinations.
  arXiv  Detail & Related papers  (2022-06-28T17:54:17Z)
• Unifying Voxel-based Representation with Transformer for 3D Object Detection [143.91910747605107]
  We present a unified framework for multi-modality 3D object detection, named UVTR. The proposed method aims to unify multi-modality representations in the voxel space for accurate and robust single- or cross-modality 3D detection. UVTR achieves leading performance in the nuScenes test set with 69.7%, 55.1%, and 71.1% NDS for LiDAR, camera, and multi-modality inputs, respectively.
  arXiv  Detail & Related papers  (2022-06-01T17:02:40Z)
• No-Regret Learning in Time-Varying Zero-Sum Games [99.86860277006318]
  Learning from repeated play in a fixed zero-sum game is a classic problem in game theory and online learning. We develop a single parameter-free algorithm that simultaneously enjoys favorable guarantees under three performance measures. Our algorithm is based on a two-layer structure with a meta-algorithm learning over a group of black-box base-learners satisfying a certain property.
  arXiv  Detail & Related papers  (2022-01-30T06:10:04Z)
• Dungeon and Platformer Level Blending and Generation using Conditional VAEs [7.919213739992465]
  conditional VAEs (CVAEs) were recently shown capable of generating output that can be modified using labels specifying desired content. We expand these works by using CVAEs for generating whole platformer and dungeon levels, and blending levels across these genres.
  arXiv  Detail & Related papers  (2021-06-17T05:46:03Z)
• Expressivity of Parameterized and Data-driven Representations in Quality Diversity Search [111.06379262544911]
  We compare the output diversity of a quality diversity evolutionary search performed in two different search spaces. A learned model is better at interpolating between known data points than at extrapolating or expanding towards unseen examples.
  arXiv  Detail & Related papers  (2021-05-10T10:27:43Z)
• Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
  We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
  arXiv  Detail & Related papers  (2021-04-17T20:33:24Z)
• Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network [11.055580854275474]
  We show how designers may specify gameplay measures to our system and extract high-quality (playable) levels with a diverse range of level mechanics. An online user study shows how the different mechanics of the automatically generated levels affect subjective ratings of their perceived difficulty and appearance.
  arXiv  Detail & Related papers  (2020-07-11T03:38:06Z)
• Rolling Horizon Evolutionary Algorithms for General Video Game Playing [4.560263516804932]
  Rolling Horizon Evolutionary Algorithms have recently managed to beat the state of the art in win rate across many video games. This paper presents the state of the art in Rolling Horizon Evolutionary Algorithms, combining all modifications described in literature, as well as new ones, for a large hybrid. We then use a parameter optimiser, the N-Tuple Bandit Evolutionary Algorithm, to find the best combination of parameters in 20 games from the General Video Game AI Framework.
  arXiv  Detail & Related papers  (2020-03-27T11:19:10Z)
• Controllable Level Blending between Games using Variational Autoencoders [6.217860411034386]
  We train a VAE on level data from Super Mario Bros. and Kid Icarus, enabling it to capture the latent space spanning both games. We then use this space to generate level segments that combine properties of levels from both games. We argue that these affordances make the VAE-based approach especially suitable for co-creative level design.
  arXiv  Detail & Related papers  (2020-02-27T01:38:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.