The dependency graph of game mechanics as an analytical object

deadlock detection and prospects for formal analysis

Authors

  • Vlada Kugurakova Kazan (Volga Region) Federal University

Keywords:

game mechanics, dependency graph, deadlock, Tarjan's algorithm, strongly connected components, formal methods, game design

Abstract

Modern video games are complex systems comprising dozens of interdependent mechanics, in which structural defects — deadlocks in particular — are notoriously resistant to manual detection. This paper proposes treating the dependency graph of game mechanics not as a visual aid, but as an analytical object admitting formal operations. We show that a deadlock is present in a system of mechanics if and only if the graph contains a strongly connected component of cardinality greater than one, which makes it possible to detect cyclic blockings in O(|V|+|E|) prior to the implementation stage. The method has been validated on a drone-racing simulator prototype: a structural deadlock in a system of three interdependent abilities was identified and eliminated at the design stage. We outline a research programme extending the approach: verification of temporal properties, detection of domi

Published

2026-04-30

How to Cite

Kugurakova, V. (2026). The dependency graph of game mechanics as an analytical object: deadlock detection and prospects for formal analysis. Game Innovation and Creative Industries, 1(1), 46–54. Retrieved from https://ojs.gamedev.science/index.php/GIKI/article/view/12