Metraipolis › archive › dc_b2f97069dd2f
Scenario-Driven Neuroevolution: Using Models to Guide Test Generation for Games — arXiv:2609.28130
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28130
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T11:06:31.709Z
- SHA-256 of the archived text
73833b1be36c64645735126af852ed5010f013149a295aee806c4da8e00a3938- Stable URL of this page
https://metraipolis.com/documento/dc_b2f97069dd2f
How to cite
Scenario-Driven Neuroevolution: Using Models to Guide Test Generation for Games — arXiv:2609.28130 — arXiv (en), https://arxiv.org/abs/2609.28130 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b2f97069dd2f (Metraipolis archive dc_b2f97069dd2f, sha256 73833b1be36c64645735126af852ed5010f013149a295aee806c4da8e00a3938)
BibTeX
@misc{dcb2f97069dd2f,
title = {Scenario-Driven Neuroevolution: Using Models to Guide Test Generation for Games — arXiv:2609.28130},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28130},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b2f97069dd2f; sha256 73833b1be36c64645735126af852ed5010f013149a295aee806c4da8e00a3938},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28130. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Automatically generating test inputs for games is challenging, as test generators must master the game to reach advanced program states while also ensuring robustness against the heavy program randomisation inherent to games. The test generator Neatest therefore optimises test suites consisting of neural networks that reach advanced program states and are robust to program randomisation, as they generate test inputs dynamically based on the current program state. Neatest is a white-box testing approach that aims to generate a network agent for each yet-uncovered statement or branch of the code using neuroevolution. Due to this iterative test generation approach, the algorithm does not scale well to larger programs that may contain thousands of branches. Furthermore, covering every statement or branch in a game often does not correspond to playing the game as intended. To alleviate these shortcomings, we propose combining Neatest with a model-based testing approach that allows game testers to define test scenarios via abstract game models. The test generator then no longer optimises networks to reach all branches or statements of a program, but instead trains networks to replicate the concrete desired testing behaviour expressed by the abstract game model. An evaluation on 13 Scratch games across varying genres demonstrates that Neatest, combined with model-based testing, is able to optimise agents that replicate the desired gameplay behaviour defined in the game models while increasing achieved branch coverage by 7% compared to the traditional code-guided Neatest approach. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-24 in cs.SE). Categorie arXiv: Software Engineering (cs.SE) ; Neural and Evolutionary Computing (cs.NE). Pagina del lavoro: https://arxiv.org/abs/2609.28130 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T10:13:35.120Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).