Vol 1, No 2 (2018): May

Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game

Silvester Dian Handy Permana (Universitas Trilogi)
Ketut Bayu Yogha Bintoro (Universitas Trilogi)
Budi Arifitama (Universitas Trilogi)
Ade Syahputra (Universitas Trilogi)

Article Info

Publish Date
25 May 2018


Maze Runner game is a game that requires pathfinding algorithm to get to the destination with the shortest path. This algorithm is used in an NPC that will move from start node to destination node. However, the use of incorrect algorithms can affect the length of the computing process to find the shortest path. The longer the computing process, the longer the players have to wait. This study compared pathfinding algorithms A *, Dijkstra, and Breadth First Search (BFS) in the Maze Runner game. Comparison process of these algorithms was conducted by replacing the algorithm in the game by measuring the process time, the length of the path, and the numbers of block played in the existing computing process. The results of this study recommend which algorithm is suitable to be applied in Maze Runner Game.

Copyrights © 2018

Journal Info





Computer Science & IT Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Social Sciences


IJISTECH (International Journal of Information System & Technology) has changed the number of publications to six times a year from volume 5, number 1, 2021 (June, August, October, December, February, and April) and has made modifications to administrative data on the URL LIPI Page: ...