Reward-Adaptive Iterative Discovery: A Case Study on Automated Game Testing for NHL26

Florian Fuchs, Jessy Gosselin-Grant, Boris Skuin, Michele Petteni, Alessandro Sestini +3 more
7/8/2026
cs.LGcs.AI

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Testing is a major effort for the gaming industry, requiring a significant part of development budget and people power. We present a case study on a development version of the ice hockey game EA SPORTS NHL 26, for which human playtesters test the goalie AI for behavioral exploits. To reduce the effort of re-testing the goalie AI after every game or behavior modification in the development phase, we propose Reward-Adaptive Iterative Discovery (RAID), a novel approach to automatically find exploits using an iterative Reinforcement Learning (RL) approach that trains a population of goal scoring agents. While previous approaches can already successfully find exploits, RL algorithms tend to overfit to a single solution. We introduce a simple extension on top of existing RL algorithms, such that they find multiple diverse high-quality solutions. For our first deployment of this approach, within a single experiment we were able to find six hockey scoring exploit strategies that were qualitatively similar to those that playtesters had found in hours-long manual testing sessions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{fuchs2026rewardadaptive,
  title  = {Reward-Adaptive Iterative Discovery: A Case Study on Automated Game Testing for NHL26},
  author = {Florian Fuchs and Jessy Gosselin-Grant and Boris Skuin and Michele Petteni and Alessandro Sestini and Joakim Bergdahl and Amir Baghi and Linus Gisslén},
  year   = {2026},
  eprint = {2607.07498},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.07498v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2607.07498.svg)](https://codeofpaper.com/paper/2607.07498)

Discussion