CoChat

Improving Playtesting Coverage via Curiosity Driven Reinforcement Learning Agents

Open access
Gordillo, Camilo, Bergdahl, Joakim, Tollmar, Konrad, Gisslen, Linus · 2021 · 2021 IEEE Conference on Games (CoG)

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cog52621.2021.9619048

Cites

14 of 14 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 14 references

Research works printed but not linked: 3

  1. schulman, 2017, Prox-imal policy optimization algorithms, ArXiv Preprint
  2. muratori, 0, Killing the walk monster [Conference presentation]
  3. sy, 2020, Unity game simulation Find the perfect balance with Unity and GCP

Cited by

See all 74

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
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.