Open AccessPathfinding Algorithms in Game Development
Author(s) -
Abdul Rafiq,
Tuty Asmawaty Abdul Kadir,
Siti Normaziah Ihsan
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/769/1/012021
Subject(s) - pathfinding , computer science , algorithm , heuristic , artificial intelligence , theoretical computer science , shortest path problem , graph
This review paper provides an overview of a pathfinding algorithm for game development which focuses on the algorithms and their contribution to game development. The algorithms were categorised based on their search performance. The aim of this paper is to investigate and provide insights into pathfinding algorithms for game development in the last 10 years. We summarise all pathfinding algorithms and describe their result in terms of performance (time and memory). The result of this paper is metaheuristic techniques have better performance in terms of time and memory compared to heuristic techniques as a pathfinding algorithm.