This paper provides a performance comparison of different pathfinding Algorithms used in video games. The Algorithms have been classified into three categories: informed, uninformed, and metaheuristic. Both a practical and a theoretical approach have been adopted in this paper. The practical approach involved the implementation of specific Algorithms such as Dijkstra’s, A-star, Breadth First Search, and Greedy Best First. The comparison of these Algorithms is based on different criteria including execution time, total number of iterations, shortest path length, and grid size. For the theoretical approach, information was collected from various papers to compare other Algorithms with the implemented ones. The Unity game engine was used in implementing the Algorithms. The environment used was a two-dimensional grid system.