COMPARISON OF MAZE GENERATION ALGORITHMS

Authors

  • Igors Boldovs Rēzeknes Tehnoloģiju akadēmija (LV)
  • Jurijs Vinogradovs Rēzeknes Tehnoloģiju akadēmija (LV)
  • Pēteris Grabusts Rēzeknes Tehnoloģiju akadēmija (LV)

DOI:

https://doi.org/10.17770/het2016.20.3508

Keywords:

Eller’s algorithm, Kruskal’s algorithm, Maze generation, Recursive backtracking

Abstract

The author in this work provides insight into the Maze generation. Themes which are discussed are Eller’s algorithm, Kruskal’s algorithm and Recursive backtracking algorithm. All this algorithms were compared.

Downloads

Download data is not yet available.

References

Think Labyrinth: Maze Algorithms: http://weblog.jamisbuck.org/2010/12/29/maze-generation-eller-s-algorithm

Eller’s Algorithm: http://www.neocomputer.org/projects/eller.html

Maze generation: Kruskal’s algorithm: http://weblog.jamisbuck.org/2011/1/3/maze-generation-kruskal-s-algorithm

Maze generation: Recursive backtracking: http://weblog.jamisbuck.org/2010/12/27/maze-generation-recursive-backtracking

Daedalus 3.1 http://www.astrolog.org/labyrnth/daedalus.htm

Downloads

Published

2016-04-20

Issue

No. 20 (2016): Human. Environment. Technology

Section

Information technology, mechatronics, electronics

How to Cite

[1]
I. Boldovs, J. Vinogradovs, and P. Grabusts, “COMPARISON OF MAZE GENERATION ALGORITHMS”, HET, no. 20, pp. 40–43, Apr. 2016, doi: 10.17770/het2016.20.3508.