Hi all,
Not sure it's the right place for this very first question but here it is :
Suppose i'm solving a problem using the A* algorithm (let's call it A1)
Suppose now, that for each successor s of a node n, I need to start another A* algorithm (let's call it A2)
How the cost c returned by A2 must be used to correctly guide the search in A1 ? Is it the g cost of A1, the h cost of A1 ? a part of g or h ?
Thanks,
Marcus
This is a recursive algorithm!
You need to explain it clearly so the algorithm can be defined properly;
Recursive algorithms are solved with Do while/Until loops using your if / then logic to test for the Condition.using a function to call itself.
[/font]