a 算法详解（A algorithm）.docVIP

a 算法详解（A algorithm） A algorithm detailed Part one: introduction to A* algorithm The original intention of writing this article is to meet the requirements of a net friend. Of course, I also find that there are too few Chinese websites about artificial intelligence. I am here to throw a brick to attract jade, and I hope all of you will join us enthusiastically. Or the subject, I first took the A* algorithm, because A* in the game has its typical use, is the artificial intelligence in the game representative. A* algorithm is a typical heuristic search algorithm in artificial intelligence. In order to make clear the A* algorithm, I still want to say what heuristic algorithm is. First, what is heuristic search algorithm?: In search of state space to pass it before. A state space search is a process of finding the path from the initial state to the target state by the point of view of the specialized point. Generally speaking, when we solve a problem, we can find a problem solving process, from the beginning of the solution to the result of the problem. Because there are a lot of branches in the process of solving the problem, mainly solving condition in the process of solving the uncertainty caused by the incompleteness of the solution path, many which constitute a map, we say this is a diagram of state space. The solution to the problem is to find a path in the diagram, from the beginning to the end. The search process is a state space search. The commonly used state space search has depth first and breadth first. Breadth first is looking down from the initial layer to the next, until the target is found. Depth first is to look up a branch in a certain order, and then find another branch, so as to find the target so far. These two algorithms are described in the data structure book, which can be explained in more detail. One of the big drawbacks to breadth and depth first search is that they are all exhausted in a given state space. This is a very suitable algorithm in