A星寻路入门双语版(A-starPathfindingforBeginners).docxVIP

A* Pathfinding for Beginners This article has been translated into Spanish and French. Other translations are welcome. While it is easy once you get the hang of it, the A* (pronounced A-star) algorithm can be complicated for beginners. There are plenty of articles on the web that explain A*, but most are written for people who understand the basics already. This one is for the true beginner. 虽然掌握了 A* （读作 A-star ）算法就认为它很容易，对于初学者来说，它却是复杂的。网上有很多解释 A* 的文章，不过大多数是写给理解了基础知识的人。本文是给初学者的。 This article does not try to be the definitive work on the subject. Instead it describes the fundamentals and prepares you to go out and read all of those other materials and understand what they are talking about. Links to some of the best are provided at the end of this article, under Further Reading. 本文并不想成为关于这个主题的权威论文。实际上它讨论了基础知识并为你做一些准备，以便进一步阅读 其他资料和理解它们讨论的内容。本文的后面列出了几个最好的文章，在进阶阅读中。 Finally, this article is not program-specific. You should be able to adapt whats here to any computer language. As you might expect, however, I have included a link to a sample program at the end of this article. The package contains two versions: one in C++ and one in Blitz Basic. It also contains executables if you just want to see A* in action. 最后，本文不是编程规范的。你应该能够改写这里的东西到任何计算机语言上。如你所期望的，同时，我 包含了一个示例程序的链接，在本文后面结束的地方。这个程序包有两个版本：一个是 C++ ，另一个用 Blitz Basic 语言编写。如果你只是想看看 A* 的行为，里面也含有可执行 exe 文件。 But we are getting ahead of ourselves. Lets start at the beginning ... 但我们要超越自己。让我们从头开始 ... 介绍：搜索区域 Introduction: The Search Area Lets assume we have someone who wants to get from point A to point B and that a wall separates the two points. This is illustrated in the graphic found below, with green being the starting point A, red being the ending point B, and the blue filled squares being the wall in between. 我们假设某人想从 A 点到达 B 点，一堵墙把它们分开了。 如下图所示， 绿色是开始点 A，红色是结束点 B， 而蓝色填充的方块是中间的墙。 [ 图 1][Figure 1] The first thing you should notice is that we have divided our search area into a square grid. Simplifying the search area, as we