Improving Playtesting Coverage via Curiosity Driven Reinforcement Learning Agents
Open accessThe DOI matches its Crossref record; 14 of the 15 references it cites were found in a registry or an index.
Abstract
As modern games continue growing both in size and complexity, it has become more challenging to ensure that all the relevant content is tested and that any potential issues are properly identified and fixed. Attempting to maximize testing coverage using only human participants, however, results in a tedious and hard to orchestrate process which normally slows down the development cycle. Complementing playtesting via autonomous agents has shown great promise accelerating and simplifying this process. This paper addresses the problem of automatically exploring and testing a given scenario using reinforcement learning agents trained to maximize game state coverage. Each of these agents is rewarded based on the novelty of its actions, thus encouraging a curious and exploratory behaviour on a complex 3D scenario where previously proposed exploration techniques perform poorly. The curious agents are able to learn the complex navigation mechanics required to reach the different areas around the map, thus providing the necessary data to identify potential issues. Moreover, the paper also investigates different visualization strategies and evaluates how to make better use of the collected data to drive design decisions and to recognize possible problems and oversights.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Although these studies aim to enhance behavioral diversity to improve test coverage, they lack mechanisms to control or direct the learned policy toward specific play styles.”
From UBCL: A Reinforcement Learning Framework for Controllable and Diverse Player Behaviors (2026) · cites this paper as [29]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Lastly, researchers employed curiosity to increase the playtesting coverage of an RL agent [33].”
From Playtesting: What is Beyond Personas (2023) · cites this paper as [33]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“However, such agents often converge to repetitive and non-human optimal behaviors.”
From UBCL: A Reinforcement Learning Framework for Controllable and Diverse Player Behaviors (2026) · cites this paper as [29]
Experimental — accuracy not yet measured
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
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
Curiosity-Driven Exploration by Self-Supervised Prediction
Pathak, D., Agrawal, P., Efros, A. A., & Darrell, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2017.70 · Cited by 1,815
(2016) · neural information processing systems · Cited by 735
A Possibility for Implementing Curiosity and Boredom in Model-Building Neural Controllers
Schmidhuber, J. (1991) · From Animals to Animats · doi:10.7551/mitpress/3115.003.0030 · Cited by 421
Wuji: Automatic Online Combat Game Testing Using Evolutionary Deep Reinforcement Learning
Zheng, Y., Xie, X., Su, T., Ma, L., Hao, J., Meng, Z., Liu, Y., Shen, R., Chen, Y., & Fan, C. (2019) · 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2019.00077 · Cited by 174
Automated Playtesting With Procedural Personas Through MCTS With Evolved Heuristics
Holmgard, C., Green, M. C., Liapis, A., & Togelius, J. (2019) · IEEE Transactions on Games · doi:10.1109/tg.2018.2808198 · Cited by 125
Augmenting Automated Game Testing with Deep Reinforcement Learning
Bergdahl, J., Gordillo, C., Tollmar, K., & Gisslen, L. (2020) · 2020 IEEE Conference on Games (CoG) · doi:10.1109/cog47356.2020.9231552 · Cited by 91
Self-citationA survey on intrinsic motivation in reinforcement learning
Aubret, A., Matignon, L., & Hassas, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.06976 · Cited by 87
Stahlke, S., Nova, A., & Mirza-Babaei, P. (2020) · Annual Symposium on Computer-Human Interaction in Play · doi:10.1145/3410404.3414249 · Cited by 41
Research works printed but not linked: 3
- schulman, 2017, Prox-imal policy optimization algorithms, ArXiv Preprint
- muratori, 0, Killing the walk monster [Conference presentation]
- sy, 2020, Unity game simulation Find the perfect balance with Unity and GCP
Cited by
Towards automated video game testing: still a long way to go
Politowski, C., Guéhéneuc, Y., & Petrillo, F. D. S. (2022) · doi:10.1145/3524494.3527627 · Cited by 64
Automated Gameplay Testing and Validation With Curiosity-Conditioned Proximal Trajectories
Sestini, A., Gisslén, L., Bergdahl, J., Tollmar, K., & Bagdanov, A. D. (2022) · IEEE Transactions on Games · doi:10.1109/tg.2022.3226910 · Cited by 47
Self-citationDirect Behavior Specification via Constrained Reinforcement LearningPreprint
Roy, J., Girgis, R., Romoff, J., Bacon, P., & Pal, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.12228 · Cited by 34
Synthesizing Game Levels for Collaborative Gameplay in a Shared Virtual Environment
Liu, H., Choi, M., Kao, D., & Mousas, C. (2022) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/3558773 · Cited by 33
Taesiri, M. R., Macklon, F., & Bezemer, C. (2022) · International Conference on Mining Software Repositories (MSR) · doi:10.1145/3524842.3528438 · Cited by 30
Metadata
- Authors
- Gordillo, C., Bergdahl, J., Tollmar, K., & Gisslen, L.
- Affiliations
- Electronic Arts (United States) (US)
- SEED - Electronic Arts (EA),Stockholm,Sweden
- Venue
- 2021 IEEE Conference on Games (CoG)
- Publisher
- IEEE
- Published
- 2021-08-17
- Pages
- 1-8
- OpenAlex
- W3136629921
- Cited by
- 50
- References
- 15
- Citations by year
- 2026: 6 · 2025: 10 · 2024: 11 · 2023: 11 · 2022: 11 · 2021: 1
- FWCI
- 3.92
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Conference on Games (CoG) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Keywords
- game testing, curiosity-driven exploration, reinforcement learning agents
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: Improving Playtesting Coverage via Curiosity Driven Reinforcement Learning Agents. https://app.cochat.ai/papers/10.1109/cog52621.2021.9619048
- The paper
- Gordillo, C., Bergdahl, J., Tollmar, K., & Gisslen, L. (2021). Improving Playtesting Coverage via Curiosity Driven Reinforcement Learning Agents. 2021 IEEE Conference on Games (CoG). https://doi.org/10.1109/cog52621.2021.9619048
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.