Efficiency Analysis of Conventional and Weighted Grid-Based Pathfinding Algorithms: A Performance Comparative Study

In many computing applications, grid-based algorithms are essential, particularly in the gaming industry where performance, shortest path and efficiency are crucial. In order to find the best algorithm for gaming settings, this research emphasizes the importance of grid-based algorithms. The primary objective is to evaluate and contrast the various grid-based algorithms’ performances while taking into account both weighted and conventional grid configurations. The implementation of the Dijkstra’s, A*, and Breadth-First Search (BFS) algorithms for both normal and weighted grids will provide insights into their applicability for gaming applications. Also, in weighted grid factors, the method known as Jump Point Search with weight will be incorporated for additional comparison. A number of measures, such as cost analysis, time complexity, space complexity, and weight complexity, will be used to conduct the evaluation process. By comparing these algorithms to one another through the process of benchmarking, the aim is to identify which algorithm offers the highest performance across all of these measures. The results of this investigation will offer significant recommendations for game designers looking to improve the performance of pathfinding algorithms in their works.