| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

# Show document

Title: Iskanje poti v računalniških igrah : zaključno delo Balaj, Leon (Author)Kolmanič, Simon (Mentor) More about this mentor... VS_Balaj_Leon_2019.pdf (1,31 MB)MD5: 4F96AFADF83766AE067AD35613A267A1 Slovenian Bachelor thesis/paper (mb11) 2.11 - Undergraduate Thesis FERI - Faculty of Electrical Engineering and Computer Science Diplomsko delo obravnava dva algoritma za iskanje poti v računalniških igrah. Najprej se seznanimo s problemom iskanja najkrajše poti v grafu ter iskalnima algoritmoma A* in Dijkstrovim algoritmom, ki ju kasneje implementiramo v okolju Unity v programskem jeziku C# ter preizkusimo njuno delovanje v vnaprej pripravljenem labirintu. Med seboj primerjamo delovanje algoritma na različnih izbranih začetnih točkah ter dobljene rezultate tudi analiziramo. računalniške igre, Unity, iskanje poti, Dijkstrov algoritem, algoritem A* 2019 Maribor [L. Balaj] X, 42 str. Maribor 004.92.021(043.2) 22922262 URN:SI:UM:DK:OMUGPEJ9 507 63 KTFMB - FERI

Average score: (0 votes) Voting is allowed only for logged in users. AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

## Licences

License: CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes. 04.11.2019

## Secondary language

Language: English Pathfinding in computer games In this diploma thesis two algorithms for pathfinding in computer games are described. First we get acquainted with the problem of finding the shortest path in the graph, and also with the search algorithms A* and Dijkstra, which are later implemented in Unity with C# and tested in a predefined labyrinth. We compare the two algorithms with different starting points and analyze the results. computer games, Unity, pathfinding, Dijkstra's algorithm, A* search algorithm