Evolutionary Level Repair

• URL: http://arxiv.org/abs/2506.19359v1
• Date: Tue, 24 Jun 2025 06:41:18 GMT
• Title: Evolutionary Level Repair
• Authors: Debosmita Bhaumik, Julian Togelius, Georgios N. Yannakakis, Ahmed Khalifa,
• Abstract summary: We address the problem of game level repair, which consists of taking a designed but non-functional game level and making it functional.<n>We use a machine learning-based procedural content generation (PCGML) method that generates stylistically appropriate but frequently broken levels.
• Score: 3.877713544082347
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We address the problem of game level repair, which consists of taking a designed but non-functional game level and making it functional. This might consist of ensuring the completeness of the level, reachability of objects, or other performance characteristics. The repair problem may also be constrained in that it can only make a small number of changes to the level. We investigate search-based solutions to the level repair problem, particularly using evolutionary and quality-diversity algorithms, with good results. This level repair method is applied to levels generated using a machine learning-based procedural content generation (PCGML) method that generates stylistically appropriate but frequently broken levels. This combination of PCGML for generation and search-based methods for repair shows great promise as a hybrid procedural content generation (PCG) method.

Related papers

• PATS: Process-Level Adaptive Thinking Mode Switching [53.53401063490537]
  Current large-language models (LLMs) typically adopt a fixed reasoning strategy, either simple or complex, for all questions, regardless of their difficulty.<n>This neglect of variation in task and reasoning process complexity leads to an imbalance between performance and efficiency.<n>Existing methods attempt to implement training-free fast-slow thinking system switching to handle problems of varying difficulty, but are limited by coarse-grained solution-level strategy adjustments.<n>We propose a novel reasoning paradigm: Process-Level Adaptive Thinking Mode Switching (PATS), which enables LLMs to dynamically adjust their reasoning strategy based on the difficulty of each step, optimizing the balance between
  arXiv  Detail & Related papers  (2025-05-25T17:58:50Z)
• IQPFR: An Image Quality Prior for Blind Face Restoration and Beyond [56.99331967165238]
  Blind Face Restoration (BFR) addresses the challenge of reconstructing degraded low-quality (LQ) facial images into high-quality (HQ) outputs.<n>We propose a novel framework that incorporates an Image Quality Prior (IQP) derived from No-Reference Image Quality Assessment (NR-IQA) models.<n>Our method outperforms state-of-the-art techniques across multiple benchmarks.
  arXiv  Detail & Related papers  (2025-03-12T11:39:51Z)
• LLMs as Continuous Learners: Improving the Reproduction of Defective Code in Software Issues [62.12404317786005]
  EvoCoder is a continuous learning framework for issue code reproduction. Our results show a 20% improvement in issue reproduction rates over existing SOTA methods.
  arXiv  Detail & Related papers  (2024-11-21T08:49:23Z)
• Guided Game Level Repair via Explainable AI [3.2228025627337864]
  Procedurally generated levels created by machine learning models can be unsolvable without further editing. This paper proposes using explainability methods to identify specific regions of a level that contribute to its unsolvability. Our results, tested across three games, demonstrate that this approach can help to repair procedurally generated levels faster.
  arXiv  Detail & Related papers  (2024-10-30T15:12:36Z)
• Principled Penalty-based Methods for Bilevel Reinforcement Learning and RLHF [82.73541793388]
  We introduce the first principled algorithmic framework for solving bilevel RL problems through the lens of penalty formulation. We provide theoretical studies of the problem landscape and its penalty-based gradient (policy) algorithms. We demonstrate the effectiveness of our algorithms via simulations in the Stackelberg Markov game, RL from human feedback and incentive design.
  arXiv  Detail & Related papers  (2024-02-10T04:54:15Z)
• A Generalized Alternating Method for Bilevel Learning under the Polyak-{\L}ojasiewicz Condition [63.66516306205932]
  Bilevel optimization has recently regained interest owing to its applications in emerging machine learning fields. Recent results have shown that simple alternating iteration-based iterations can match interest owing to convex lower-level objective.
  arXiv  Detail & Related papers  (2023-06-04T17:54:11Z)
• Combining Evolutionary Search with Behaviour Cloning for Procedurally Generated Content [2.7412662946127755]
  We consider the problem of procedural content generation for video game levels. Prior approaches have relied on evolutionary search (ES) methods capable of generating diverse levels. We propose a framework to tackle the procedural content generation problem that combines the best of ES and RL.
  arXiv  Detail & Related papers  (2022-07-29T16:25:52Z)
• Level Generation for Angry Birds with Sequential VAE and Latent Variable Evolution [25.262831218008202]
  We develop a deep-generative-model-based level generation for the game domain of Angry Birds. Experiments show that the proposed level generator drastically improves the stability and diversity of generated levels.
  arXiv  Detail & Related papers  (2021-04-13T11:23:39Z)
• Video Game Level Repair via Mixed Integer Linear Programming [20.815591392882716]
  The proposed framework constructs levels using a generative adversarial network (GAN) trained with human-authored examples and repairs them using a mixed-integer linear program (MIP) with playability constraints. Results show that the proposed framework generates a diverse range of playable levels, that capture the spatial relationships between objects exhibited in the human-authored levels.
  arXiv  Detail & Related papers  (2020-10-13T18:37:58Z)
• A Novel CNet-assisted Evolutionary Level Repairer and Its Applications to Super Mario Bros [11.366146167882007]
  We propose a novel approach, CNet, to learn the probability of tiles giving its surrounding tiles on a set of real levels, and then detect the illegal tiles in generated new levels. Our CNet-assisted evolutionary repairer can also be easily applied to other games of which the levels can be represented by a matrix of objects or tiles.
  arXiv  Detail & Related papers  (2020-05-13T04:27:18Z)
• Incremental Object Detection via Meta-Learning [77.55310507917012]
  We propose a meta-learning approach that learns to reshape model gradients, such that information across incremental tasks is optimally shared. In comparison to existing meta-learning methods, our approach is task-agnostic, allows incremental addition of new-classes and scales to high-capacity models for object detection.
  arXiv  Detail & Related papers  (2020-03-17T13:40:00Z)

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.