Diskussion:Heuristics: A*-algorithm 3

Comment #1

Hey,

you wrote a good article, but there are some things wich you may want to have a second look at:

"used to find the shortest path between two nodes in a complete graph"

"The node with the most minimal value will be analyzed futhermore"

Not a must, have a look at the assignments, in them we looked for the longest path. A* searchs the optimal solution - however you define optimal.

"2. Sort the OPEN LIST according to the node's values in an ascending order"

No need to to this, because you select the node with the minimal value in step 3.. So why should we also sort it if we don't select the first element afterwards?

"5. Construct your optimal path and show your final CLOSED LIST"

Maybe you should also write how to construct the path

"If the end node is reached, than the A* ends."

What do you mean with "reached"? Will it end when the end node gets added to the OPEN-List or when A* has a look at it and removes it from the OPEN-list?

"So the A* is optimal, if a monotnous heuristic is used."

I am not sure if this is correct, i think the solution is optimal, if the heuristic is admissable

Greetings