axing算法（取消算法）.docVIP

axing算法（取消算法） Three, A* algorithm In the A* algorithm, more generally, an evaluation function f is introduced, which is defined as f=g+h. Where G is the cost of reaching the current node, and the H represents the slave Estimation of the cost of the arrival of the former node to the target. It must meet two requirements: 1. H must be less than or equal to the actual minimum cost h* to reach the target node from the current node. 2. F must remain monotonically increasing. The control structure of the A* algorithm is very similar to that of breadth search, but each extension is one of the smallest F values in the currently extended node, if The extended node is repeated with the extended node, and the node is deleted. If the node to be extended is repeated, if the function of this node is evaluated When the value is small, it is used instead of the original node to be extended. The specific algorithm is described as follows: Example: a 3*3 board has 1-8, eight numbers, and a space. An initial state and a target state are given. This space is required, Reach the target state with the least number of steps. Problem analysis: the expected value is defined as h=|x-dx|+|y-dy|. The valuation function is defined as f=g+h. Type Node (node type) = Record Situtation:TSituation (current node status); G:Integer; the cost of reaching the current state H:Integer; (estimated cost) F:Real; (valuation function value) Last:Integer; (parent node) End Var List (node table): Array[1..Max (maximum number of nodes)] of Node (node type); Open (total number of nodes): Integer; Close (to be extended node number): Integer; New-S:Tsituation; (new node) Init List-0; Open-1; Close-0; List[1].Situation- initial state; Main Program While (closeopen (and not extended nodes)) and (openMax (space not used up)) and (the destination node was not found) do Begin Begin Close:=close+1; For, I:=close+1, to, open, do (looking for the smallest node of the valuation function) Begin If List.fList[close].f then Be