Analysis of Multiple Shortest Path Finding Algorithm in Novel Gaming Scenario

The most important research area in gaming is shortest path finding. Many video games are facing the problem of path finding and there are many algorithms present to resolve the problem of shortest path finding such as breadth-first search, depth-first search, Dijkstra's algorithm and best-first search. A* algorithm has been proved the best algorithm for resolving the problem of shortest path finding in games. It provides the optimal solution for path finding as compared to other search algorithm. In the starting section, brief introduction about the path finding is given. Then the reviews of different search algorithm are presented on the basis of path finding. After that information of A* algorithm is described. In the last, application and examples of how the path finding techniques are used in the game are addressed and future work and conclusion are drawn. In this paper, comparison is drawn on search algorithm on the basis of path finding in games. A* algorithm gives the optimal solution in a faster way as compare to other algorithm. A* uses a heuristic function and movement amount from start node to any other node n, so A* select the most promising node for expanding due to this property A* gives optimal solution.