Illuminating the Space of Dungeon Maps, Locked-door Missions and Enemy Placement Through MAP-Elites

• URL: http://arxiv.org/abs/2202.09301v1
• Date: Fri, 18 Feb 2022 17:06:04 GMT
• Title: Illuminating the Space of Dungeon Maps, Locked-door Missions and Enemy Placement Through MAP-Elites
• Authors: Breno M. F. Viana (1), Leonardo T. Pereira (1), Claudio F. M. Toledo (1) ((1) Universidade de S\~ao Paulo)
• Abstract summary: This paper introduces an extended version of an evolutionary dungeon generator by incorporating a MAP-Elites population. Our dungeon levels are discretized with rooms that may have locked-door missions and enemies within them. We encoded the dungeons through a tree structure to ensure the feasibility of missions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Procedural Content Generation (PCG) methods are valuable tools to speed up the game development process. Moreover, PCG may also present in games as features, such as the procedural dungeon generation (PDG) in Moonlighter (Digital Sun, 2018). This paper introduces an extended version of an evolutionary dungeon generator by incorporating a MAP-Elites population. Our dungeon levels are discretized with rooms that may have locked-door missions and enemies within them. We encoded the dungeons through a tree structure to ensure the feasibility of missions. We performed computational and user feedback experiments to evaluate our PDG approach. They show that our approach accurately converges almost the whole MAP-Elite population for most executions. Finally, players' feedback indicates that they enjoyed the generated levels, and they could not indicate an algorithm as a level generator.

Related papers

• AgentGym: Evolving Large Language Model-based Agents across Diverse Environments [116.97648507802926]
  Large language models (LLMs) are considered a promising foundation to build such agents. We take the first step towards building generally-capable LLM-based agents with self-evolution ability. We propose AgentGym, a new framework featuring a variety of environments and tasks for broad, real-time, uni-format, and concurrent agent exploration.
  arXiv  Detail & Related papers  (2024-06-06T15:15:41Z)
• Ghost in the Minecraft: Generally Capable Agents for Open-World Environments via Large Language Models with Text-based Knowledge and Memory [97.87093169454431]
  Ghost in the Minecraft (GITM) is a novel framework that integrates Large Language Models (LLMs) with text-based knowledge and memory. We develop a set of structured actions and leverage LLMs to generate action plans for the agents to execute. The resulting LLM-based agent markedly surpasses previous methods, achieving a remarkable improvement of +47.5% in success rate.
  arXiv  Detail & Related papers  (2023-05-25T17:59:49Z)
• SPRING: Studying the Paper and Reasoning to Play Games [102.5587155284795]
  We propose a novel approach, SPRING, to read the game's original academic paper and use the knowledge learned to reason and play the game through a large language model (LLM) In experiments, we study the quality of in-context "reasoning" induced by different forms of prompts under the setting of the Crafter open-world environment. Our experiments suggest that LLMs, when prompted with consistent chain-of-thought, have great potential in completing sophisticated high-level trajectories.
  arXiv  Detail & Related papers  (2023-05-24T18:14:35Z)
• Persona-driven Dominant/Submissive Map (PDSM) Generation for Tutorials [5.791285538179053]
  We present a method for automated persona-driven video game tutorial level generation. We use procedural personas to calculate the behavioral characteristics of levels which are evolved. Within this work, we show that the generated maps can strongly encourage or discourage different persona-like behaviors.
  arXiv  Detail & Related papers  (2022-04-11T16:01:48Z)
• Long-Term Exploration in Persistent MDPs [68.8204255655161]
  We propose an exploration method called Rollback-Explore (RbExplore) In this paper, we propose an exploration method called Rollback-Explore (RbExplore), which utilizes the concept of the persistent Markov decision process. We test our algorithm in the hard-exploration Prince of Persia game, without rewards and domain knowledge.
  arXiv  Detail & Related papers  (2021-09-21T13:47:04Z)
• Generating Lode Runner Levels by Learning Player Paths with LSTMs [2.199085230546853]
  In this paper, we attempt to address problems by learning to generate human-like paths, and then generating levels based on these paths. We extract player path data from gameplay video, train an LSTM to generate new paths based on this data, and then generate game levels based on this path data. We demonstrate that our approach leads to more coherent levels for the game Lode Runner in comparison to an existing PCGML approach.
  arXiv  Detail & Related papers  (2021-07-27T00:48:30Z)
• 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)
• Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated Environments [66.80667987347151]
  Methods based on intrinsic rewards often fall short in procedurally-generated environments. We introduce RAPID, a simple yet effective episode-level exploration method for procedurally-generated environments. We demonstrate our method on several procedurally-generated MiniGrid environments, a first-person-view 3D Maze navigation task from MiniWorld, and several sparse MuJoCo tasks.
  arXiv  Detail & Related papers  (2021-01-20T14:22:01Z)
• 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)
• Using Tabu Search Algorithm for Map Generation in the Terra Mystica Tabletop Game [60.71662712899962]
  Tabu Search (TS) metaheuristic improves simple local search algorithms by enabling the algorithm to escape local optima points. This paper investigates the performance of TS and considers the effects of the size of the Tabu list and the size of the neighbourhood for a procedural content generation.
  arXiv  Detail & Related papers  (2020-06-04T09:15:46Z)
• Interactive Evolution and Exploration Within Latent Level-Design Space of Generative Adversarial Networks [8.091708140619946]
  Latent Variable Evolution (LVE) has recently been applied to game levels. This paper introduces a tool for interactive LVE of tile-based levels for games. The tool also allows for direct exploration of the latent dimensions, and allows users to play discovered levels.
  arXiv  Detail & Related papers  (2020-03-31T22:52:17Z)

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.