Hey, everyone! It’s been a few months since I posted on my blog like this, but that’s because I’ve been hard at work on a new tutorial for you all!
One of the more popular pages on this site has been a link I provided to ActiveState’s C++ A* Algorithm, and, while that’s good and all, it’s not really a tutorial by any means, and, well, it’s someone else’s stuff. I wanted to show you guys not only how it’s done, by the whos and whys.
So, without further TODOs…
It’s got history, jokes, source code, images, the works!
Let me know what you guys think! Tell your friends! MAKE THE MACHINES BEND TO YOUR WILL!
That last part is a little exaggerated, but that’s basically what you’ll be doing!
OK, so a while back I posted a link for a simple implementation for A* Pathfinding for C/C++. The page gets a bunch of hits, but I get a lot of people asking me to explain it. Well, it’s not my code to really explain, and I haven’t tested it out for myself. Rather than go through and make a huge tutorial, I figured I’d take the lazy route, and provide you with a resource to help explain it a bit. This page breaks down A*Pathfinding to the basics and gives a great explanation down to even the heuristics (If you don’t know that word, you’ll need this link).
So, now with this in hand, pathfinding should be easier to grasp now. Give it another go, and let me know how it turns out! Good luck!
Update: Oct. 4th, 2018
Hey! So I stopped being so lazy, and actually wrote up a tutorial for A* Pathfinding that I call KMStar! Go ahead and check it out!