Automation of Subway Surfers using Finite State Machines

Theoretical machines like automata are critical to many computing operations because they provide a foundation for resolving difficult problems in various domains. Automata theory, in particular, simplifies and increases productivity in game development by allowing for flexible and effective game design. This study analyzes how the popular mobile single-player game Subway Surfer incorporates non-deterministic finite automata (NFA) into its gameplay design. Automata theory can be used to enhance the entire gaming experience by automating boosters such as hoverboards, jetpacks, and pogo sticks, among other game components. Non-deterministic finite automata are popular among game designers because of their inherent adaptability, allowing for various outcomes from a single state. This functionality comes in handy in a fast-paced game like Subway Surfer, where the player must dodge several obstacles and make quick choices. A theoretical model of Subway Surfer utilizing NFA is created using the educational program JFlap, showing how different input strings can be accepted or rejected. The main goal of this research is to better understand gaming dynamics and the workings of different in-game boosters by applying automata theory.