Enhancing NeuroEvolution-Based Game Testing: A Branch Coverage Approach for Scratch Programs
Khizra Sohail, Atif Aftab Ahmed Jilani, and Nigar Azhar Butt

TL;DR
This paper improves automated game testing for Scratch programs by integrating branch coverage into neuroevolution, leading to better fault detection and higher control flow exploration compared to statement coverage alone.
Contribution
It introduces a branch coverage-based fitness function for neuroevolution in Scratch game testing, enhancing fault detection over existing statement coverage methods.
Findings
NBC achieves higher branch coverage in 13 of 25 games.
NBC has a lower false positive rate in mutation testing.
Branch coverage improves fault detection in complex conditional structures.
Abstract
Automated test generation for game-like programs presents unique challenges due to their non-deterministic behavior and complex control structures. The NEATEST framework has been used for automated testing in Scratch games, employing neuroevolution-based test generation optimized for statement coverage. However, statement coverage alone is often insufficient for fault detection, as it does not guarantee execution of all logical branches. This paper introduces a branch coverage-based fitness function to enhance test effectiveness in automated game testing. We extend NEATEST by integrating a branch fitness function that prioritizes control-dependent branches, guiding the neuroevolution process to maximize branch exploration. To evaluate the effectiveness of this approach, empirical experiments were conducted on 25 Scratch games, comparing Neatest with Statement Coverage (NSC) against…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
