Return to Question

I'm trying to implement A* path finding algorithm (now it's Dijkstra's algorithm i.e without heuristic) using this article http://www.policyalmanac.org/games/aStarTutorial.htm. But I can't figure out what's wrong in my code (it finds incorrect path).

I'm trying to implement A* path finding algorithm (now it's Dijkstra's algorithm i.e without heuristic) using this article Link. But I can't figure out what's wrong in my code (it finds incorrect path).

I'm trying to implement A* path finding algorithm (now it's Dijkstra's algorithm i.e without heuristic) using this article http://www.policyalmanac.org/games/aStarTutorial.htm. But I can't figure out what's wrong in this my code (it finds incorrect path).

where empty body of begin ... end; it should be this step:

I'm trying to implement A* path finding algorithm (now it's Dijkstra's algorithm i.e without heuristic) using this article http://www.policyalmanac.org/games/aStarTutorial.htm. But I can't figure out what's wrong in my code (it finds incorrect path).

instead of the empty begin ... end; it should be this step:

where void body of begin ... end; it should be this step:

where empty body of begin ... end; it should be this step:

Edit Feb 1 '12: updated code, also fixed path marking (there should be or instead and), looks like it works now :)