A*A Preliminary Study of Pathfinding Original source: A* Pathfinding for Beginners The translator's preface It is not difficult for the participants, the A* (pronounced A star) algorithm is indeed a bit difficult for beginners.
在这一点,你应该形成如图的结构。在图中,暗绿色方格是你起始方格的中心。它被用浅蓝色描边,以表示它被加入到关闭列表中了。所有的相邻格现在都在开启列表中,它们被用浅绿色描边。每个方格都有一个灰色指针反指他们的父方格,也就是开始的方格。 F = G + H 这里:
我们的路径是通过反复遍历开启列表并且选择具有最低F值的方格来生成的。文章将对这个过程做更详细的描述。首先,我们更深入的看看如何计算这个方程。
题外话
Further reading Ok, now you have a preliminary understanding of some further points. At this time, I suggest you study my source code. The package contains two versions, one is written in C++ and the other is in Blitz Basic. By the way, both versions are well-commented and easy to read, here is the link. 例子代码:A* Pathfinder (2D) Version 1.71
其它一些值得一看的网站: Other reference articles: Okay, that's all. If you happen to write a program that uses these ideas, I want to be insightful. You can contact me like this:now, good luck!
|
The easiest a* algorithm I have ever seen (A* pathfinding preliminary exploration)
http://blog.vckbase.com/panic/archive/2005/03/20/3778.html
Guess you like
Origin blog.csdn.net/windcao/article/details/1533879
Recommended
Ranking