Research Article
Maze Runner: Angel and Demon Path Finding Game Application using C-Theta* Algorithm
@INPROCEEDINGS{10.4108/eai.24-10-2018.2280610, author={Silvester Dian Handy Permana and Ketut Bayu Yogha Bintoro and Budi Arifitama and Ade Syahputra}, title={Maze Runner: Angel and Demon Path Finding Game Application using C-Theta* Algorithm}, proceedings={The 1st International Conference on Computer Science and Engineering Technology Universitas Muria Kudus}, publisher={EAI}, proceedings_a={ICCSET}, year={2018}, month={11}, keywords={pathfinding c theta* algorithm game pathfinding maze runner game}, doi={10.4108/eai.24-10-2018.2280610} }- Silvester Dian Handy Permana
Ketut Bayu Yogha Bintoro
Budi Arifitama
Ade Syahputra
Year: 2018
Maze Runner: Angel and Demon Path Finding Game Application using C-Theta* Algorithm
ICCSET
EAI
DOI: 10.4108/eai.24-10-2018.2280610
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
