Designer Difficulties: Visualizing the Possibility Spaces of Dynamic Difficulty Adjustment Systems
Bibliographic record
Abstract
Dynamic Difficulty Adjustment (DDA) systems procedurally tune video games during runtime to deliver a designer-specified, balanced gameplay experience for players. DDA systems have been well-studied and deployed in both academic and industry contexts. However, a relatively unexplored challenge of DDA systems is how to assess the diversity of experiences they can deliver to players and whether or not the range of possible DDA actions will satisfy the original game designer's goals. DDA systems are inherently unpredictable in their output due to being designed to react to game-states that are uncertain and ever-changing. The varying scope and unpredictability of DDA systems means human playtesting can be time- and cost-intensive, and automated playtesting may produce misleading results. In this work, we introduce an approach for using expressive range analysis and unsupervised clustering to explore and evaluate gameplay traces from an in-development DDA system (FighterDDA) for turn-based role-playing game encounters. We find that this is an effective method for assessing designer goals and re-tuning accordingly an in-development system by visualizing and understanding the character of different DDA approaches. While specific to this system, we believe that there is promise in extending this approach to other genres and DDA platforms in the future.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".