Talk:Artificial Intelligence/Search/Heuristic search/Astar Search

I sincerely think the pseudocode presented here is wrong. Read it. I'm not an expert in A*, and i still can see that it does the same thing in two conditions. And if I combine those: I didn't edit the page because I've only recently understood the A* search algorithm, and my suggestions are based on my current best understanding of the algorithm, but I can honestly say this article did not help me in the process at all. I'd like if it could help others. (Hint: the wikipedia page for the A* algorithm actually has a pseudocode that is much better) Atommalac (discuss • contribs) 11:48, 7 January 2012 (UTC)
 * If the new node is not in either lists, it should set the parent, and calculate the f and h values for it as well, not just the g value,
 * "our current g value" should be specified more accurately, as this shouldn't be the g value of the "current node" itself, but the g value of the "current node" plus the cost of traveling from "current node" to "current neighbor of iteration" (variables should be named too, in my opinion).