A* Pathfinding Tutorial @SynforgeTutorials
A* Pathfinding Tutorial  @SynforgeTutorials
Uploaded March 2014 | Updated November 2026, 3 hours ago
____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
policyalmanac.org/games/aStarTutorial.htm
A* Pathfinding TutorialSliding Camera Transition w/ Animation Curves | GMS2.3.2 TutorialBasic Java #1 Installing JDKBasic Platformer | GMS2.3 TutorialBasic Java #3 Primitive Data TypesQuick Tips (Game Maker) : Web DebuggingCreating Custom Fonts Game Maker TutorialParallax Coding Part IIJava Swing #2 Grid Layout & Action Listener TutorialRubiks Cube Tutorial Part 1How to be informed?Screen Shake w/ Animation Curves | GMS2.3 Tutorial
Arend Peter Teaches |

A* Pathfinding Tutorial

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER