Maze Runner: Angel and Demon Path Finding Game Application using C-Theta* Algorithm

Abstract

Pathfinding algorithm is an algorithm used to find the shortest path between two locations. This algorithm is used by some puzzle and strategy games. In maze game, pathfinding algorithm is used to find the shortest path to reach the finish point. However, the usual pathfinding algorithm has not been able to get the fastest path and computation so players need long waiting times in this game. In this research, the player becomes a "demon" that prevents the NPC from moving. The player is given several obstacles to be arranged so that the NPC takes the longest path of the possibilities. C-Theta* has the best ability to find the shortest path in the established grid. NPCs here become "angels" who are always looking for the shortest path from obstacles provided by players. This game asks for the longest time and distance from obstacles that can be composed by players.

A Review of Pathfinding in Game Development

“…Permana et al [21] created Maze Runner: Angel and Demon, a pathfinding game using C-Theta* for angel NPC and Player as a Demon. NPC has the objective to find a path to the goal while the Player arranged obstacles in a 25x25 grid map with the limitation on certain cells that can not be placed as an obstacle to ensure that NPC will always find the goal.…”