Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index; 4 of the 9 sources its claims cite were checked for support.

Simulation-Driven Balancing of Competitive Game Levels With Reinforcement Learning

Open access
Rupp, Florian, Eberhardinger, Manuel, Eckert, Kai · 2024 · IEEE Transactions on Games

Abstract

The balancing process for game levels in competitive two-player contexts involves a lot of manual work and testing, particularly for non-symmetrical game levels. In this work, we frame game balancing as a procedural content generation task and propose an architecture for automatically balancing of tile-based levels within the PCGRL framework (procedural content generation via reinforcement learning). Our architecture is divided into three parts: (1) a level generator, (2) a balancing agent, and (3) a reward modeling simulation. Through repeated simulations, the balancing agent receives rewards for adjusting the level towards a given balancing objective, such as equal win rates for all players. To this end, we propose new swap-based representations to improve the robustness of playability, thereby enabling agents to balance game levels more effectively and quickly compared to traditional PCGRL. By analyzing the agent's swapping behavior, we can infer which tile types have the most impact on the balance. We validate our approach in the Neural MMO (NMMO) environment in a competitive two-player scenario. In this extended conference paper, we present improved results, explore the applicability of the method to various forms of balancing beyond equal balancing, compare the performance to another search-based approach, and discuss the application of existing fairness metrics to game balancing.

Overview

CoChat Summary

TL;DR

The paper frames competitive level balancing as a PCGRL task and proposes a three-part architecture—level generator, balancing agent, and simulation-based reward—using new swap-based tile representations. In a simplified two-player Neural MMO forage-survival domain, the method improves balance more effectively than original PCGRL and hill climbing while keeping levels playable.

Key findings

  • Swap representations improved balance over original PCGRL: S-narrow balanced 48.1% and improved 63.3%, S-turtle 42.5%/56.8%, S-wide 48.1%/64.1%, versus PCGRL narrow 30.4%/36.7%; original PCGRL left 38.8% of levels unplayable, while swap methods produced 100% playable levels in this domain.
  • Extended training and separate spawn-tile encodings raised performance to 68.0% balanced and 88.9% improved for target balance b = 0.5; for varied targets b ∈ [0, 0.5], balanced-to-b rates ranged from 36.1% at b = 0.0 to 68.0% at b = 0.5, with improved-toward-b rates from 71.1% to 88.9%.
  • PCGRL with S-wide outperformed hill climbing across b values; at b = 0.5 it balanced 68.0% versus 59.6% for S-narrow hill climbing and 14.3% for narrow hill climbing, while narrow hill climbing left 83.1%–92.4% of levels unplayable.
  • Swap-frequency analysis indicated swapping forest for stone had the most impact on balance, followed by forest for water; swapping player spawn positions was not a favored action. Generated levels had 100% diversity and none were symmetric.

Methods

  • Uses the PCGRL framework with PPO and introduces swap-narrow, swap-turtle, and swap-wide MDP representations; reward is derived from statistical parity, with balance state b_t = |wp1_t − b| and reward r_t = b_{t−1} − b_t + α.
  • Level generator is trained separately to produce playable levels with exactly two players and a valid path; balancing agent then swaps tiles, and reward is computed from n = 14 simulations using the scripted Forage-agent in Neural MMO.
  • Experiments use a 6×6 grid, two players, combat disabled, win conditions of collecting five food or being last standing; evaluation uses 1,000 generated levels, 200k training steps / 970 policy updates, 20% change percentage, and max 100 steps per episode.

Limitations

  • Stated: the balance metric depends on the heuristic player agents used in simulation; different skill levels or agent types would change the measured balance, and human playtests are left for future work.
  • Stated: training is computationally intensive because each swap requires multiple simulations; rewards are mostly sparse, and swapping may break playability in domains where multiple tiles have semantic relationships. The paper also notes fairness is a social/ethical concept and that residual uncertainty may require treating a range rather than an exact target as balanced.
  • Evident: evaluation is limited to a simplified 6×6 two-player Neural MMO forage-survival setting with combat disabled and scripted agents; not all levels reach the target balance (e.g., 68.0% balanced at b = 0.5, 36.1% at b = 0.0), so the method improves but does not fully solve balancing.

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

Integrity signals

Registry

Crossref · 10.1109/tg.2024.3399536

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

2 Valid · 5 Not valid · 5 Not checked · 71 Own results and interpretations

32 more claims

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

See all claims — free account
  • Probably not a substantial claim. 29
  • It may state two separate claims as one. 27
  • The quote only partly states this claim. 1

Create a free account to see these claims.

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.

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

3 of 3

Citations

Cites

Show all 52 references

Research works printed but not linked: 1

  1. Elo, 1978, The Rating of Chessplayers, Past and Present

Cited by

See all 11

Metadata

Authors
Rupp, F., Eberhardinger, M., & Eckert, K.
Affiliations
  • Technische Hochschule Mannheim (DE)
  • Stuttgart Media University (DE)
Venue
IEEE Transactions on Games
Published
2024-12
Volume
16
Issue
4
Pages
903-913
ISSN
  • 2475-1502 (ISSN-L)
  • 2475-1510
OpenAlex
W4396790128
Cited by
11
References
52
Citations by year
2026: 6 · 2025: 3 · 2024: 2
FWCI
1.62
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Games (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
Volkswagen Foundation through the Project: Consequences of Artificial Intelligence on Urban Societies (98555)
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
procedural content generation, reinforcement learning, reward modeling, fairness metrics

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-10-01, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

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

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: Simulation-Driven Balancing of Competitive Game Levels With Reinforcement Learning. https://app.cochat.ai/papers/10.1109/tg.2024.3399536
The paper
Rupp, F., Eberhardinger, M., & Eckert, K. (2024). Simulation-Driven Balancing of Competitive Game Levels With Reinforcement Learning. IEEE Transactions on Games. https://doi.org/10.1109/tg.2024.3399536

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.