The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
The case for dynamic difficulty adjustment in games
Abstract
Conventional wisdom suggests that while players enjoy unpredictability or novelty during gameplay experiences, they will feel "cheated" if games are adjusted during or across play sessions. In order for adjustment to be effective, it must be performed without disrupting or degrading the core player experience. This paper examines basic design requirements for effective dynamic difficulty adjustment (DDA) given this constraint, presents an interactive DDA system (Hamlet), and offers preliminary evaluation results which challenge common assumptions about player enjoyment and adjustment dynamics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to dynamic systems: theory, models and applications
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90069-0 · Cited by 1,122
Current Approaches to Change Blindness
Simons, D. J. (2000) · Visual Cognition · doi:10.1080/135062800394658 · Cited by 512
Triesch, J., Ballard, D. H., Hayhoe, M. M., & Sullivan, B. T. (2003) · Journal of Vision · doi:10.1167/3.1.9 · Cited by 337
Virtual Worlds: A First-Hand Account of Market and Society on the Cyberian FrontierPreprint
Castronova, E. (2001) · RePEc: Research Papers in Economics · Cited by 306
Interactive drama, art and artificial intelligence
Mateas, M., Bates, J., & Carbonell, J. (2002) · Cited by 188
Cited by
Monte Carlo Tree Search: a review of recent modifications and applications
Świechowski, M., Godlewski, K., Sawicki, B., & Mańdziuk, J. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10228-y · Cited by 365
Dynamic difficulty adjustment in exer-games for rehabilitation: a mixed approach
Pezzera, M., & Borghese, N. A. (2020) · 2020 IEEE 8th International Conference on Serious Games and Applications for Health (SeGAH) · doi:10.1109/segah49190.2020.9201871 · Cited by 35
Deep Player Behavior Models: Evaluating a Novel Take on Dynamic Difficulty Adjustment
Pfau, J., Smeddinck, J. D., & Malaka, R. (2019) · Extended Abstracts of the 2019 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3290607.3312899 · Cited by 17
(2020) · doi:10.1145/3383668.3419905 · Cited by 15
Metadata
- Authors
- Hunicke, R.
- Venue
- Proceedings of the 2005 ACM SIGCHI International Conference on Advances in computer entertainment technology
- Publisher
- ACM
- Published
- 2005-06-15
- Pages
- 429-433
- OpenAlex
- W2050787672
- Cited by
- 441
- References
- 5
- FWCI
- 1.19
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The case for dynamic difficulty adjustment in games. https://app.cochat.ai/papers/10.1145/1178477.1178573
- The paper
- Hunicke, R. (2005). The case for dynamic difficulty adjustment in games. Proceedings of the 2005 ACM SIGCHI International Conference on Advances in computer entertainment technology. https://doi.org/10.1145/1178477.1178573
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.