Algorithm

Process (computing)

Engineering

Node (physics)

Theoretical computer science

Shortest Path Faster Algorithm

Operating system

Computer science

Dijkstra's algorithm

Graph

Mathematics

Block (permutation group theory)

Path (computing)

Geometry

Pathfinding

Yen's algorithm

Structural engineering

Shortest path problem

IJISTECH (International Journal Of Information System & Technology)

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.

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