Maze Adventure: An Application of Maze Algorithm in Role-playing Game Development by Python

Abstract

This paper talks about the development and algorithms of a 2D role-playing game coded in Python: Maze Adventure. The game is developed based on the Aldous Broder maze generation algorithm, a random walk algorithm, which is a way to produce uniform spanning trees. With the maze that is drawn by these uniform spanning trees, this paper introduces each part of code that has different functions, which works together to form a complete game. It summarizes the basic algorithms for not only the maze algorithm, but how to apply and link the function with the game's structure. It includes the generation and modification of different types of sprites, a Misty algorithm that hides most of the mazes for players to explore, and various ways of connecting collision detection along with the maze, in order to let players fight monsters or pick up treasures. It’s an exploration of how to combine a traditional maze algorithm with new media like games, and by finishing Maze Adventure, it remarkably proved that Python language has strong fluidity, which is capable of using one of the newest media: Games.