20.500.12556/DKUM-77136 Algoritmi za generiranje labirintov magistrsko delo 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's 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's algorithm and depth-first-search for traversing the generated mazes, which in essence are nothing more than graphs. labirint Kruskal DFS graf maze Kruskal DFS graph true true false [G. Ivanič] Slovenski jezik Angleški jezik Magistrsko delo/naloga 2020-08-18 19:09:52 2020-11-03 07:15:10 2022-08-09 14:24:25 2020-11-19 03:21:21 2020 0 Maribor 0 Maribor VIII, 69 f. 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.421.2(043.2) 37272835 URN:SI:UM:DK:PMU9YBUX MAG_Ivanic_Gregor_2020.pdf MAG_Ivanic_Gregor_2020.pdf 1 66B275F54713E14847C2B00350F875A8 d59081e769c93c942768b6c11973d9a973ed072e8895444586b53d1dfa92326c cbe2be8c-7c11-11eb-bb7a-00155d0001ca 20.500.12556/dkum/b08c177c-8600-4ba4-aeca-9c9e13b278b2 https://dk.um.si/Dokument.php?lang=slv&id=145456 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0