Bayesian Optimization-based Search for Agent Control in Automated Game Testing

Carlos Celemin
8/18/2025
cs.AI

No confident code implementation found for this paper.

Abstract

This work introduces an automated testing approach that employs agents controlling game characters to detect potential bugs within a game level. Harnessing the power of Bayesian Optimization (BO) to execute sample-efficient search, the method determines the next sampling point by analyzing the data collected so far and calculates the data point that will maximize information acquisition. To support the BO process, we introduce a game testing-specific model built on top of a grid map, that features the smoothness and uncertainty estimation required by BO, however and most importantly, it does not suffer the scalability issues that traditional models carry. The experiments demonstrate that the approach significantly improves map coverage capabilities in both time efficiency and exploration distribution.

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. Any repos shown below are weak matches — 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{celemin2025bayesian,
  title  = {Bayesian Optimization-based Search for Agent Control in Automated Game Testing},
  author = {Carlos Celemin},
  year   = {2025},
  eprint = {2508.13121},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.13121v1}
}

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/2508.13121.svg)](https://codeofpaper.com/paper/2508.13121)

Discussion