A* Pathfinding Tutorial
___PLEASE READ____
I made a flaw in the explanation of the logic. In step 3 (Pick block with lowest F), I infered that the block must be adjacent to the current block, however the lowest F is picked from all blocks that have been processed but that have not yet been closed.
Thus the backtracking I did at 9:40 isn't necessary since your evaluating the same list of Fs no matter what your current node is.
If I had done this correctly I would have ended up checking several more nodes.
At 12:28 I ended up selecting a node with a F of 68 however there were several options with a F of 60 that I should have chosen.
______________________
In this video I'll be showing you how A* Path Finding algorithms work. This is very useful when programming AI in games.
Here's the link to the tutorial I mentioned
http://www.policyalmanac.org/games/aS...
Auf dieser Seite können Sie das Online-Video A* Pathfinding Tutorial mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer Arend Peter Teaches 06 März 2014 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 38,771 Mal angesehen und es wurde von 467 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!
