Maze pathfinding algorithms

Namen diplomske naloge je predstavitev različnih pristopov reševanja problema iskanja poti v labirintu med dvema točkama. Spoznali smo klasične metode, kot so iskanje v širino, iskanje v globino, Dijkstrov algoritem, algoritem A*, Usmerjeno požrešno iskanje ter algoritem levega pravila. Vsak algoritem smo opisali in ga vizualno predstavili. V zaključku pogledamo še rezultate posameznega pristopa na dveh primerih ter opišemo naše ugotovitvePurpose of this degree paper is to present different methods for solving the problem of finding a path in a labyrinth between two points. We are introduced to classical methods such as Breadth-First Search, Depth-First Search, Dijkstra\u27s algorithm, Astar, Greedy Best-First Search, and Left turn algorithm. We described each algorithm and visually presented them. In the end, we look at the results of each method on two examples and describe our findings