Illuminating the Space of Enemies Through MAP-Elites
Action-Adventure games have several challenges to overcome, where the most common are enemies. The enemies' goal is to hinder the players' progression by taking life points, and the way they hinder this progress is distinct for different kinds of enemies. In this context, this paper introduces an extended version of an evolutionary approach for procedurally generating enemies that target the enemy's difficulty as the goal. Our approach advances the enemy generation research by incorporating a MAP-Elites population to generate diverse enemies without losing quality. The computational experiment showed the method converged most enemies in the MAP-Elites in less than a second for most cases. Besides, we experimented with players who played an Action-Adventure game prototype with enemies we generated. This experiment showed that the players enjoyed most levels they played, and we successfully created enemies perceived as easy, medium, or hard to face.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Illuminating the Space of Dungeon Maps, Locked-door Missions and Enemy Placement Through MAP-Elites
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…
Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network
Generative adversarial networks (GANs) are quickly becoming a ubiquitous approach to procedurally generating video game levels. While GAN generated levels are stylistically similar to human-authored examples, human desig…
DiversityGenerative Adversarial NetworkMech-Elites: Illuminating the Mechanic Space of GVGAI
This paper introduces a fully automatic method of mechanic illumination for general video game level generation. Using the Constrained MAP-Elites algorithm and the GVG-AI framework, this system generates the simplest til…
Illuminating search spaces by mapping elites
Many fields use search algorithms, which automatically explore a search space to find high-performing solutions: chemists search through the space of molecules to discover new drugs; engineers search for stronger, cheape…
Generating and Blending Game Levels via Quality-Diversity in the Latent Space of a Variational Autoencoder
Several works have demonstrated the use of variational autoencoders (VAEs) for generating levels in the style of existing games and blending levels across different games. Further, quality-diversity (QD) algorithms have …
Diversity