Mech-Elites: Illuminating the Mechanic Space of GVGAI

• URL: http://arxiv.org/abs/2002.04733v2
• Date: Wed, 24 Aug 2022 15:41:03 GMT
• Title: Mech-Elites: Illuminating the Mechanic Space of GVGAI
• Authors: M Charity, Michael Cerny Green, Ahmed Khalifa, Julian Togelius
• Abstract summary: This paper introduces a fully automatic method of mechanic illumination for general video game level generation. We apply this method to mechanic space for $4$ different games in GVG-AI: Zelda, Solarfox, Plants, and RealPortals.
• Score: 6.32656340734423
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 tile based levels that contain specific sets of game mechanics and also satisfy playability constraints. We apply this method to illuminate mechanic space for $4$ different games in GVG-AI: Zelda, Solarfox, Plants, and RealPortals.

Related papers

• WorldGen: From Text to Traversable and Interactive 3D Worlds [87.95088818329403]
  We introduce WorldGen, a system that enables the automatic creation of large-scale, interactive 3D worlds directly from text prompts.<n>Our approach transforms natural language descriptions into fully textured environments that can be immediately explored or edited within standard game engines.<n>This work represents a step towards accessible, generative world-building at scale, advancing the frontier of 3D generative AI for applications in gaming, simulation, and immersive social environments.
  arXiv  Detail & Related papers  (2025-11-20T22:13:18Z)
• Regular Games -- an Automata-Based General Game Playing Language [1.1677036706091175]
  We propose a new General Game Playing (GGP) system called Regular Games (RG)<n>The main goal of RG is to be both computationally efficient and convenient for game design.<n>RG's ecosystem includes an editor with LSP, automaton visualization, benchmarking tools, and a debugger of game description transformations.
  arXiv  Detail & Related papers  (2025-11-13T18:29:27Z)
• Cardiverse: Harnessing LLMs for Novel Card Game Prototyping [9.435009911810955]
  Card games require extensive human effort in creative ideation and gameplay evaluation. Recent advances in Large Language Models offer opportunities to automate and streamline these processes. This paper addresses these challenges by introducing a comprehensive automated card game prototyping framework.
  arXiv  Detail & Related papers  (2025-02-10T23:47:35Z)
• PlaMo: Plan and Move in Rich 3D Physical Environments [68.75982381673869]
  We present PlaMo, a scene-aware path planner and a robust physics-based controller. The planner produces a sequence of motion paths, considering the various limitations the scene imposes on the motion. Our control policy generates rich and realistic physical motion adhering to the plan.
  arXiv  Detail & Related papers  (2024-06-26T10:41:07Z)
• Improved Techniques for Optimization-Based Jailbreaking on Large Language Models [78.32176751215073]
  Greedy Coordinate Gradient (GCG) attack's success has led to a growing interest in the study of optimization-based jailbreaking techniques. We present several improved (empirical) techniques for optimization-based jailbreaks like GCG. The results demonstrate that our improved techniques can help GCG outperform state-of-the-art jailbreaking attacks and achieve nearly 100% attack success rate.
  arXiv  Detail & Related papers  (2024-05-31T17:07:15Z)
• Accelerate Multi-Agent Reinforcement Learning in Zero-Sum Games with Subgame Curriculum Learning [65.36326734799587]
  We present a novel subgame curriculum learning framework for zero-sum games. It adopts an adaptive initial state distribution by resetting agents to some previously visited states. We derive a subgame selection metric that approximates the squared distance to NE values.
  arXiv  Detail & Related papers  (2023-10-07T13:09:37Z)
• 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)
• Green Hierarchical Vision Transformer for Masked Image Modeling [54.14989750044489]
  We present an efficient approach for Masked Image Modeling with hierarchical Vision Transformers (ViTs) We design a Group Window Attention scheme following the Divide-and-Conquer strategy. We further improve the grouping strategy via the Dynamic Programming algorithm to minimize the overall cost of the attention on the grouped patches.
  arXiv  Detail & Related papers  (2022-05-26T17:34:42Z)
• CCPT: Automatic Gameplay Testing and Validation with Curiosity-Conditioned Proximal Trajectories [65.35714948506032]
  The Curiosity-Conditioned Proximal Trajectories (CCPT) method combines curiosity and imitation learning to train agents to explore. We show how CCPT can explore complex environments, discover gameplay issues and design oversights in the process, and recognize and highlight them directly to game designers.
  arXiv  Detail & Related papers  (2022-02-21T09:08:33Z)
• Illuminating the Space of Dungeon Maps, Locked-door Missions and Enemy Placement Through MAP-Elites [0.0]
  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.
  arXiv  Detail & Related papers  (2022-02-18T17:06:04Z)
• Tile Embedding: A General Representation for Procedural Level Generation via Machine Learning [1.590611306750623]
  We present tile embeddings, a unified, affordance-rich representation for tile-based 2D games. We employ autoencoders trained on the visual and semantic information of tiles from a set of existing, human-annotated games. We evaluate this representation on its ability to predict affordances for unseen tiles, and to serve as a PLGML representation for annotated and unannotated games.
  arXiv  Detail & Related papers  (2021-10-07T04:48:48Z)
• Towards General Function Approximation in Zero-Sum Markov Games [126.58493169301012]
  This paper considers two-player zero-sum finite-horizon Markov games with simultaneous moves. Provably efficient algorithms for both decoupled and coordinated settings are developed.
  arXiv  Detail & Related papers  (2021-07-30T15:25:13Z)
• Generating and Blending Game Levels via Quality-Diversity in the Latent Space of a Variational Autoencoder [7.919213739992465]
  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.
  arXiv  Detail & Related papers  (2021-02-24T18:44:23Z)
• Game Mechanic Alignment Theory and Discovery [5.5805433423452895]
  We present a new concept called Game Mechanic Alignment theory. By disentangling player and environmental influences, mechanics may be better identified for use in an automated tutorial generation system.
  arXiv  Detail & Related papers  (2021-02-20T03:41:03Z)
• Mario Level Generation From Mechanics Using Scene Stitching [6.32656340734423]
  Our system uses an FI-2Pop algorithm and a corpus of scenes to perform automated level authoring. Our system is able to maximize the number of matched mechanics while reducing emergent mechanics using the stitching process compared to the greedy approach.
  arXiv  Detail & Related papers  (2020-02-07T19:44:44Z)

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.