Implementation of Pathfinding on NPC Using A* Algorithm Into Game Platformer Application

Abstract The rapid advancement of game development driven by the latest technologies has become an engaging topic of study, particularly in the application of efficient pathfinding methods. This research implements the A* algorithm within a platformer game application to address the common challenge of pathfinding, which involves navigating obstacles and determining the most optimal route. The A* algorithm is widely recognized for its efficiency, simplicity, and strong real-time performance, making it a popular choice for such tasks. In this study, two key performance metrics were evaluated: the time required for a Non-Player Character (NPC) to locate the player and the resulting Frames Per Second (FPS). These metrics were measured under two conditions: when the main character was stationary and when it was in motion. The findings indicate that a stationary main character allows faster NPC search times and higher FPS, whereas a moving main character increases search time and reduces FPS.