CoChat

Playtesting: What is Beyond Personas

Open access
Ariyurek, Sinan, Surer, Elif, Betin-Can, Aysu · 2023 · IEEE Transactions on Games

The DOI matches its Crossref record; 33 of the 53 references it cites were found in a registry or an index; 17 of the 28 sources its claims cite were checked for support.

Abstract

Playtesting is an essential step in the game design process. Game designers use the feedback from playtests to refine their designs. Game designers may employprocedural personasto automate the playtesting process. In this article, we present two approaches to improve automated playtesting. First, we proposedeveloping persona, which allows a persona to progress to different goals. In contrast, the procedural persona is fixed to a single goal. Second, a human playtester knows which paths she has tested before, and during the consequent tests, she may test different paths. However, reinforcement learning (RL) agents disregard these previous paths. We propose a novel methodology that we refer to as alternative path finder (APF). We train APF with previous paths and employ APF during the training of an RL agent. APF modulates the reward structure of the environment, while preserving the agent’s goal. When evaluated, the agent generates a different trajectory that achieves the same goal. We use the general video game artificial intelligence and VizDoom frameworks to test our proposed methodologies. We use proximal policy optimization RL agent during experiments. First, we compare the playtest data generated by developing and procedural persona. Our experiments show that developing persona provides better insight into the game and how different players would play. Second, we present the alternative paths found using APF and argue why traditional RL agents cannot learn those paths.

Verifying this paper

8 of 9 steps done · this page updates itself — you can leave and come back

  1. Registry recordVerified
  2. Full textRead the full text
  3. Reference list33 references found
  4. Reference checkChecking each cited work — 33 of 33
  5. StatisticsRecomputed
  6. Claims134 claims anchored to a quote
  7. Cited sourcesChecked
  8. Self-checkChecked
  9. VerificationFindings verified

Overview

CoChat Summary

TL;DR

The paper proposes a “developing persona” that links multiple goals with criteria and utility functions, and an Alternative Path Finder (APF) that modulates RL rewards to discover trajectories different from previously seen paths. Experiments in GVG-AI and VizDoom show developing personas give broader/more controllable playtest behavior than procedural personas, and APF finds alternative paths that traditional RL agents overlook.

Key findings

  • In GVG-AI Experiment I, procedural personas interacted with a small region and often produced the same behavior: Exit, Monster Killer, Treasure Collector, and Completionist each killed 1 monster, collected 1 treasure, and reached 1 door. Developing personas interacted more broadly: Dev. Killer killed 3 monsters, Dev. Collector collected 4 treasures, Dev. Raider killed 3 and collected 4, and Dev. Completionist killed 5 and collected 8.
  • With PPO+CTS, procedural personas fit their decision models better: Monster Killer killed 2 monsters, Treasure Collector collected 3 treasures, and Completionist killed 2 and collected 3.
  • APFCTS found alternative paths in GVG-AI: Path 1 had four alternative paths (Paths 2–6); using APFCTS decreased reward for playing the same path by at least 0.1 and increased reward for space-disjoint paths by at least 0.1. APFCTS clustered paths into equivalence classes {1,2} and {3,4,5,6}.
  • In Doom Experiment III over 1000 evaluations, personas behaved per specification: Exit reached the door 1.00±0.00; Monster Killer killed 5.79±0.91 monsters; Dev. Killer killed 3.54±0.98; Treasure Collector killed 1.94±0.70 and collected 0.94±0.24 treasures; Dev. Collector killed 2.00±0.65 and collected 0.95±0.22; Dev. Raider killed 3.52±0.73 and collected 0.98±0.15; Completionist killed 5.76±1.06 and collected 1.91±0.38; Dev. Completionist killed 5.81±0.92 and collected 1.91±0.36; Dev. Casual Completionist killed 5.83±0.53 and collected 0.98±0.13.
  • In Doom Experiment IV, without APFICM the Exit persona took the first path (52 steps) with reward 0.80±0.02 versus second path (77 steps) 0.68±0.01; after training APFICM on path 1, path 1 reward dropped to 0.51±0.02 and path 2 rose to 0.78±0.01.

Methods

  • The paper introduces developing persona as a procedural persona extended to a linked sequence of goals, each with a utility function and transition criteria; it also introduces APF, with APFCTS using Context Tree Switching recoding probability and APFICM using Intrinsic Curiosity Module prediction error to add reward/penalty for novel versus similar states/transitions.
  • Experiments use GVG-AI (14×20 grid, 200 timesteps, six actions) and two VizDoom levels (1600×832 and 1664×704, 2000 timesteps, seven actions), with PPO agents from StableBaselines; the deterministic first game was evaluated once, while stochastic Doom games were evaluated 1000 times, and the APF experiment used the same random seed.
  • Four procedural personas (Exit, Monster Killer, Treasure Collector, Completionist) and five developing personas (Dev. Killer, Dev. Collector, Dev. Raider, Dev. Completionist, Dev. Casual Completionist) were tested, with utility weights and criteria specified in tables.

Limitations

  • Stated: developing and procedural persona performance depends on the RL algorithm; if the RL algorithm cannot play a game, the designer cannot benefit from these automated playtesters. APF performance is linked to how well the underlying exploration algorithm performs in the environment.
  • Stated: APF feedback is unbounded, so agents may loop over novel states or get stuck; strict game portions with no alternative paths may be penalized; APFCTS can be sensitive to slight frame noise; APFICM is more data-intensive and requires a previously trained agent for transfer learning. Alternative paths are also subjective for game designers even if APF is objective.
  • Evident from the text: utility functions were handcrafted rather than extracted from human playtest data, and the evaluation is limited to GVG-AI and VizDoom testbeds without direct human playtest comparison.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1109/tg.2022.3165882

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

12 Valid · 2 Not valid · 7 Not checked · 113 Own results and interpretations

63 more claims

Create a free account to see all 134 claims and to verify the 1 reference still open.

See all claims — free account
  • Probably not a substantial claim. 37
  • It may state two separate claims as one. 35

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

4 of 4

Citations

Cites

Show all 33 references

Research works printed but not linked: 1

  1. bartle, 2005, Virtual worlds: Why people play, Massively Multiplayer Game Development, 2, 3

Cited by

See all 7

Metadata

Authors
Ariyurek, S., Surer, E., & Betin-Can, A.
Affiliations
  • Middle East Technical University (TR)
  • Graduate School of Informatics, Middle East Technical University, Ankara, Turkey
Venue
IEEE Transactions on Games
Published
2023-09
Volume
15
Issue
3
Pages
348-359
ISSN
  • 2475-1502 (ISSN-L)
  • 2475-1510
OpenAlex
W3185235798
Cited by
7
References
53
Citations by year
2026: 2 · 2025: 3 · 2024: 1 · 2023: 1
FWCI
0.41
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Games (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • OpenMETU (Middle East Technical University) (submittedVersion, cc-by-nc-nd)
  • arXiv (Cornell University) (cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Social Sciences › Sociology and Political Science › Digital Games and Media
Keywords
game testing, game design, reinforcement learning agents, player behavior modeling, ViZDoom, proximal policy optimization

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-11-01, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-11-01 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

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: Playtesting: What is Beyond Personas. https://app.cochat.ai/papers/10.1109/tg.2022.3165882
The paper
Ariyurek, S., Surer, E., & Betin-Can, A. (2023). Playtesting: What is Beyond Personas. IEEE Transactions on Games. https://doi.org/10.1109/tg.2022.3165882

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.