The study and application of artificial intelligence pathfinding algorithm in game domain

In today´s game world, A* algorithm is the most widely used pathfinding algorithm of artificial intelligence, and it is also one of the most effective shortest pathfinding algorithms, we have introduced A* algorithm. We puts forward deficiency of standard A* algorithm, because standard A* algorithm may detour in the search process, an improved A* algorithm is proposed which increases a father pointer for each node. We can effectively solved the problem by keep back according to each father node after searching, that we ensure the resulting is optimal path. Last, we use Visual C++.NET development environment in Windows XP operating system, we simulation and realized the pathfinding process of improved A* algorithm that greatly improve the efficiency and accuracy in searching, and it has realized the pathfinding intellectualized.