Examination of representational expression in maze generation algorithms

Abstract

Procedural content generation is widely used in game development, although it does not give an opportunity to generate the whole game level. However, for some game artifacts procedural generation is the preferred way of creation. Mazes are a good example of such artifacts: manual generation of mazes does not provide a variety of combinations and makes games too predictable. This article gives an overview of three basic two-dimensional maze generation algorithms: Depth-first search, Prim's, and Recursive Definition. These algorithms describe three conceptually different approaches to maze generation. The path lengths of the algorithms are compared, and advantages and disadvantages of each algorithm are given.