Implementation of Cellular Automata and Fisher Yates Methods on Map Generators in Building Games Using Unity 3D Game Engine 2021

Abstract

The increasing demand for dynamic and replayable game experiences has led to the widespread adoption of procedural content generation, particularly in creating non-repetitive and immersive game environments. This research presents the implementation of Cellular Automata and the Fisher-Yates Shuffle algorithm to develop an efficient and adaptive map generator system within a game built using the Unity 3D Game Engine. Cellular Automata is utilized to generate natural-looking map structures, such as cave-like or maze-like formations, through a grid-based simulation that evolves over multiple iterations based on the states of neighboring cells. This method enables the generation of unique and organic map layouts for each game session. To address potential issues such as disconnected areas and unfair object placement, the Fisher-Yates Shuffle algorithm is applied to randomly distribute key gameplay elements—including player spawn points, enemies, and items—across valid and accessible map regions in an unbiased manner. The system was tested under various parameter configurations to evaluate map quality, connectivity, and computational performance. The results demonstrate that the combination of Cellular Automata and Fisher-Yates Shuffle can effectively generate varied, functional, and aesthetically pleasing maps with high performance and consistency. Furthermore, Unity 3D proved to be a suitable platform for integrating the procedural generation system with other game components such as AI navigation and resource management. This study concludes that integrating Cellular Automata with Fisher-Yates Shuffle offers a robust solution for creating adaptive procedural map generators that enhance gameplay diversity, reduce manual level design time, and improve overall player engagement