A * algorithm, Algorithm

A * algorithm, Algorithm

In the past few days, I have been searching for automatic pathfinding. The most common online algorithm I have seen is the * algorithm. Now I understand its principles. The following describes my learning ideas.

First of all, I want to understand the idea of A * algorithm. This article on the link below is A godworks recommended on the Internet. All Chinese Characters in English include:

Http://www.policyalmanac.org/games/aStarTutorial.htm.

This is a Chinese version: http://www.cppblog.com/christanxw/archive/2006/04/07/5126.html

After carefully reading the above two articles, you can't wait to see their implementation code. Don't worry, paste the code online below,

Http://rangercyh.blog.51cto.com/1444712/792044

Http://www.cnblogs.com/kex1n/archive/2012/07/09/2582926.html

After reading this, you can try to write some plane A * algorithms, but the premise is that you have corresponding map data!

 

So the two-dimensional pathfinding is complete, but if I want to do 3D pathfinding, can I use A *? Of course, the answer is OK!