In this thesis, we present algorithms for creating and solving of labyrinths. We presented the characteristics of labyrinths and how are they related to the graphs. We selected five known algorithms from the literature, two of our own for creation and two algorithms for solving labyrinths. All algorithms are described, presented with their good and bad sides and implemented. All algorithms are part of an application which allows labyrinth solving and presentation of step by step construction. The application is written in Python programming language. In the last part, an analysis of time and space complexity is shown, which proves binary tree algorithm is the fastest and least expensive algorithm for creating labyrinths. Our two algorithms have similar performance, too.
|
