Identifying Artificial Intelligence Pathfinding Algorithms for Platformer Games

Pathfinding has been a major research area in video games for decades. It is usually utilised as the core of any Artificial Intelligence movement system in computer games. This paper reviews the pathfinding algorithms employed in the platformer genre of video games and focuses on determining better-suited algorithms to be used. In order to determine the algorithms used in platformer games, first, we need to determine the existing pathfinding algorithms that are currently in use today. Then, the algorithms are narrowed down to ones that are most widely used due to their advantages over other algorithms. The findings indicate that A* and Djiktra are the most suitable algorithms to be used. However, past researches did not include vertical movements in 2D platformers, thus, it raises further questions concerning how much of a difference in terms of efficiency will be seen if these algorithms are tested in that particular environment.