• DocumentCode
    3683512
  • Title

    Examination of representational expression in maze generation algorithms

  • Author

    Aliona Kozlova;Joseph Alexander Brown;Elizabeth Reading

  • Author_Institution
    Department of Computer Science, Innopolis University, Kazan, Republic of Tatarstan, Russia 420111
  • fYear
    2015
  • Firstpage
    532
  • Lastpage
    533
  • 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.
  • Keywords
    "Games","Algorithm design and analysis","Prediction algorithms","Conferences","Statistical analysis","IEEE members","Computer science"
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Games (CIG), 2015 IEEE Conference on
  • ISSN
    2325-4270
  • Electronic_ISBN
    2325-4289
  • Type

    conf

  • DOI
    10.1109/CIG.2015.7317902
  • Filename
    7317902