mlsanityData to 14 Oct 2026

Continuous Reinforcement Learning-based Dynamic Difficulty Adjustment in a Visual Working Memory Game

arXiv 2308.12726 ↗First posted 24 Aug 2023cs.HC cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Dynamic Difficulty Adjustment (DDA) is a viable approach to enhance a player's experience in video games. Recently, Reinforcement Learning (RL) methods have been employed for DDA in non-competitive games; nevertheless, they rely solely on discrete state-action space with a small search space. In this paper, we propose a continuous RL-based DDA methodology for a visual working memory (VWM) game to handle the complex search space for the difficulty of memorization. The proposed RL-based DDA tailors game difficulty based on the player's score and game difficulty in the last trial. We defined a continuous metric for the difficulty of memorization. Then, we consider the task difficulty and the vector of difficulty-score as the RL's action and state, respectively. We evaluated the proposed method through a within-subject experiment involving 52 subjects. The proposed approach was compared with two rule-based difficulty adjustment methods in terms of player's score and game experience measured by a questionnaire. The proposed RL-based approach resulted in a significantly better game experience in terms of competence, tension, and negative and positive affect. Players also achieved higher scores and win rates. Furthermore, the proposed RL-based DDA led to a significantly less decline in the score in a 20-trial session.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 2 of its 31 references that are in the map. First posted on arXiv 24 Aug 2023.

Builds on

2 of 31 references.

References · 2

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2021Dynamic Difficulty Adjustment in Virtual Reality Exergames through Experience-driven Procedural Content Generationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.