Enhancing the Monte Carlo Tree Search Algorithm for Video Game Testing

2020-03-01
Arıyürek, Sinan
Betin Can, Aysu
Sürer, Elif
In this paper, we study the effects of several Monte Carlo Tree Search (MCTS) modifications for video game testing. Although MCTS modifications are highly studied in game playing, their impacts on finding bugs are blank. We focused on bug finding in our previous study where we introduced synthetic and human-like test goals and we used these test goals in Sarsa and MCTS agents to find bugs. In this study, we extend the MCTS agent with several modifications for game testing purposes. Furthermore, we present a novel tree reuse strategy. We experiment with these modifications by testing them on three testbed games, four levels each, that contain 45 bugs in total. We use the General Video Game Artificial Intelligence (GVG-AI) framework to create the testbed games and collect 427 human tester trajectories using the GVG-AI framework. We analyze the proposed modifications in three parts: we evaluate their effects on bug finding performances of agents, we measure their success under two different computational budgets, and we assess their effects on human-likeness of the human-like agent. Our results show that MCTS modifications improve the bug finding performance of the agents.
Citation Formats
S. Arıyürek, A. Betin Can, and E. Sürer, “Enhancing the Monte Carlo Tree Search Algorithm for Video Game Testing,” 2020, Accessed: 00, 2021. [Online]. Available: https://arxiv.org/abs/2003.07813.