Automated Game Testing With Online Search Agent and Model Construction, a Study

ABSTRACT Modern computer games have become very complex, so they can benefit from automated testing. However, their huge and fine grained interaction space makes them very challenging for automated testing algorithms. Having a model of a system would greatly improve the effectiveness of a testing algorithm. However, manually constructing a model is expensive and time‐consuming. This paper proposes an online agent‐based search approach to solve common testing tasks for computer games, in particular games that involve elements of world navigation and exploration. On the fly, the approach also constructs a model of the system, which is then exploited to solve the given testing task. The effectiveness of the approach is studied via a case study called Lab Recruits and its simulation of another game called Dungeons and Dragons Online. The study showed that the approach is superior in its ability to complete testing tasks and its completion time compared to evolutionary algorithm, Q‐learning and MCTS. This paper extends a previous work presented in ATEST by including evaluation on large game levels, evaluation of the achieved coverage and fault detection and the aforementioned comparison with other algorithms.

Authors

Institutions

Publication Details

Journal
Software Testing Verification and Reliability
Published
2025-02-01
DOI
https://doi.org/10.1002/stvr.70002
Citations
1
Primary Topic
Artificial Intelligence in Games
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Automated Game Testing With Online Search Agent and Model Construction, a Study

Davide Prandi, Mehdi Dastani, I. S. W. B. Prasetya, Samira Shirzadehhajimahmood et al.
1 citations
Software Testing Verification and Reliability
Artificial Intelligence in Games
2.48
article

Automated Game Testing With Online Search Agent and Model Construction, a Study

Davide Prandi, Mehdi Dastani, I. S. W. B. Prasetya, Samira Shirzadehhajimahmood, Frank Dignum, Gabriele Keller
article en
1 citations

Abstract

ABSTRACT Modern computer games have become very complex, so they can benefit from automated testing. However, their huge and fine grained interaction space makes them very challenging for automated testing algorithms. Having a model of a system would greatly improve the effectiveness of a testing algorithm. However, manually constructing a model is expensive and time‐consuming. This paper proposes an online agent‐based search approach to solve common testing tasks for computer games, in particular games that involve elements of world navigation and exploration. On the fly, the approach also constructs a model of the system, which is then exploited to solve the given testing task. The effectiveness of the approach is studied via a case study called Lab Recruits and its simulation of another game called Dungeons and Dragons Online. The study showed that the approach is superior in its ability to complete testing tasks and its completion time compared to evolutionary algorithm, Q‐learning and MCTS. This paper extends a previous work presented in ATEST by including evaluation on large game levels, evaluation of the achieved coverage and fault detection and the aforementioned comparison with other algorithms.

Software Testing Verification and ReliabilityVol. 35(2)
Utrecht University (NL), Fondazione Bruno Kessler (IT), Umeå University (SE)
European Commission, Horizon 2020 Framework Programme
Openalex Percentile: Top 12%
Artificial Intelligence in Games
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.