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...
On this page of the site you can watch the video online A* Pathfinding Tutorial with a duration of hours minute second in good quality, which was uploaded by the user Arend Peter Teaches 06 March 2014, share the link with friends and acquaintances, this video has already been watched 38,771 times on youtube and it was liked by 467 viewers. Enjoy your viewing!
