From Frustration to Fun: An Adaptive Problem-Solving Puzzle Game Powered by Genetic Algorithm

• URL: http://arxiv.org/abs/2509.23796v1
• Date: Sun, 28 Sep 2025 10:40:14 GMT
• Title: From Frustration to Fun: An Adaptive Problem-Solving Puzzle Game Powered by Genetic Algorithm
• Abstract summary: This paper explores adaptive problem solving with a game designed to support the development of problem-solving skills.<n>Using an adaptive, AI-powered puzzle game, our adaptive problem-solving system dynamically generates pathfinding-based puzzles using a genetic algorithm.<n>A player-modeling system records user interactions and informs the generation of puzzles to approximate a target difficulty level based on various metrics of the player.
• Score: 1.0098114696565863
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper explores adaptive problem solving with a game designed to support the development of problem-solving skills. Using an adaptive, AI-powered puzzle game, our adaptive problem-solving system dynamically generates pathfinding-based puzzles using a genetic algorithm, tailoring the difficulty of each puzzle to individual players in an online real-time approach. A player-modeling system records user interactions and informs the generation of puzzles to approximate a target difficulty level based on various metrics of the player. By combining procedural content generation with online adaptive difficulty adjustment, the system aims to maintain engagement, mitigate frustration, and maintain an optimal level of challenge. A pilot user study investigates the effectiveness of this approach, comparing different types of adaptive difficulty systems and interpreting players' responses. This work lays the foundation for further research into emotionally informed player models, advanced AI techniques for adaptivity, and broader applications beyond gaming in educational settings.

Related papers

• Difficulty-Controllable Cloze Question Distractor Generation [20.062590379176218]
  Multiple-choice cloze questions are commonly used to assess linguistic proficiency and comprehension.<n>We propose a novel framework for generating distractors with controllable difficulty by leveraging both data augmentation and a multitask learning strategy.<n>We show that our method generates high-quality distractors across difficulty levels and substantially outperforms GPT-4o in aligning distractor difficulty with human perception.
  arXiv  Detail & Related papers  (2025-11-03T12:42:25Z)
• HardcoreLogic: Challenging Large Reasoning Models with Long-tail Logic Puzzle Games [47.168515381473576]
  Large Reasoning Models (LRMs) have demonstrated impressive performance on complex tasks, including logical puzzle games.<n>Existing corpora focus on popular puzzles like 9x9 Sudoku, risking overfitting to canonical formats and memorization of solution patterns.<n>We introduce HardcoreLogic, a challenging benchmark of over 5,000 puzzles across 10 games.
  arXiv  Detail & Related papers  (2025-10-14T14:23:24Z)
• People use fast, flat goal-directed simulation to reason about novel problems [68.55490343866545]
  We show that people are systematic and adaptively rational in how they play a game for the first time.<n>We explain these capacities via a computational cognitive model that we call the "Intuitive Gamer"<n>Our work offers new insights into how people rapidly evaluate, act, and make suggestions when encountering novel problems.
  arXiv  Detail & Related papers  (2025-10-13T15:12:08Z)
• PuzzlePlex: Benchmarking Foundation Models on Reasoning and Planning with Puzzles [53.47227295854126]
  This work investigates the reasoning and planning capabilities of foundation models and their scalability in complex, dynamic environments.<n>We introduce PuzzlePlex, a benchmark designed to assess these capabilities through a diverse set of puzzles.
  arXiv  Detail & Related papers  (2025-10-07T21:24:29Z)
• Personalized Dynamic Difficulty Adjustment -- Imitation Learning Meets Reinforcement Learning [44.99833362998488]
  In this work, we explore balancing game difficulty using machine learning-based agents to challenge players based on their current behavior. This is achieved by a combination of two agents, in which one learns to imitate the player, while the second is trained to beat the first. In our demo, we investigate the proposed framework for personalized dynamic difficulty adjustment of AI agents in the context of the fighting game AI competition.
  arXiv  Detail & Related papers  (2024-08-13T11:24:12Z)
• Optimising Human-AI Collaboration by Learning Convincing Explanations [62.81395661556852]
  We propose a method for a collaborative system that remains safe by having a human making decisions. Ardent enables efficient and effective decision-making by adapting to individual preferences for explanations.
  arXiv  Detail & Related papers  (2023-11-13T16:00:16Z)
• Hybrid Minimax-MCTS and Difficulty Adjustment for General Game Playing [0.1657441317977376]
  We present a general approach to implement an artificial intelligence opponent with difficulty levels for zero-sum games. We propose a Minimax-MCTS hybrid algorithm, which combines the minimax search process with GGP of MCTS. This approach was tested in our mobile application LoBoGames, which is friendly to visually-impaired users.
  arXiv  Detail & Related papers  (2023-10-25T12:13:40Z)
• Procedurally generating rules to adapt difficulty for narrative puzzle games [0.0]
  This paper focuses on procedurally generating rules and communicating them to players to adjust the difficulty. A genetic algorithm is used together with a difficulty measure to find a target number of solution sets. A large language model is used to communicate the rules in a narrative context.
  arXiv  Detail & Related papers  (2023-07-07T11:14:53Z)
• Automated Graph Genetic Algorithm based Puzzle Validation for Faster Game Desig [69.02688684221265]
  This paper presents an evolutionary algorithm, empowered by expert-knowledge informeds, for solving logical puzzles in video games efficiently. We discuss multiple variations of hybrid genetic approaches for constraint satisfaction problems that allow us to find a diverse set of near-optimal solutions for puzzles.
  arXiv  Detail & Related papers  (2023-02-17T18:15:33Z)
• Experimental study of Neural ODE training with adaptive solver for dynamical systems modeling [72.84259710412293]
  Some ODE solvers called adaptive can adapt their evaluation strategy depending on the complexity of the problem at hand. This paper describes a simple set of experiments to show why adaptive solvers cannot be seamlessly leveraged as a black-box for dynamical systems modelling.
  arXiv  Detail & Related papers  (2022-11-13T17:48:04Z)
• Video Anomaly Detection by Solving Decoupled Spatio-Temporal Jigsaw Puzzles [67.39567701983357]
  Video Anomaly Detection (VAD) is an important topic in computer vision. Motivated by the recent advances in self-supervised learning, this paper addresses VAD by solving an intuitive yet challenging pretext task. Our method outperforms state-of-the-art counterparts on three public benchmarks.
  arXiv  Detail & Related papers  (2022-07-20T19:49:32Z)
• Fast Game Content Adaptation Through Bayesian-based Player Modelling [6.510061176722249]
  This paper explores a novel method to realize this goal in the context of dynamic difficulty adjustment (DDA) The aim is to constantly adapt the content of a game to the skill level of the player, keeping them engaged by avoiding states that are either too difficult or too easy. Current systems for DDA rely on expensive data mining, or on hand-crafted rules designed for particular domains, and usually adapts to keep players in the flow.
  arXiv  Detail & Related papers  (2021-05-18T12:56:44Z)
• 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)

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.