Maze generation algorithms

Cilj magistrske naloge je obravnava algoritmov s katerimi lahko generiramo labirinte. Algoritme smo analizirali glede na njihove pristranskosti, kjer ima vsak algoritem svoje določene lastnosti, ki ga ločijo od ostalih. Prav tako smo analizirali iz česa so generirani labirinti sestavljeni in kako zahtevno jih je rešiti. Pri tem smo uporabljali različne metode, kot na primer algoritem Dijkstra in algoritem iskanje v širino za sprehajanje po labirintih, ki v bistvu niso nič drugega kot grafi.The aim of the master\u27s thesis is the discussion of algorithms which can be used to generate mazes. The algorithms are analysed based on their biases, where each algorithm has its own properties that separate it from the others. Likewise, the generated mazes are analysed based on their composition and the difficulty of their solution. In doing so, there are a number of different methods which are applied, such as Dijkstra\u27s algorithm and depth-first-search for traversing the generated mazes, which in essence are nothing more than graphs