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!
Image via Wikipedia
Thank you, StumbleUpon! I just so happen to have come across a handy code snippet for the A* pathfinding algorithm. This is pretty much a staple in any AI programmer’s arsenal.
So here’s the code! Enjoy, peoples!
A-star Shortest Path Algorithm (C++ recipe)
Seeing how this is one of the more popular posts on my blog, I wanted to update the link for the algorithm. The above link works, but the creator has moved all his “recipes” to his GitHub. Here’s a link for his C++ A* Algorithm Recipe. Good luck!
Update! Oct. 4, 2018
Seeing how this is one of the more… wait, haven’t I done this before? Well, we’re doing it again, because now I have an A* algorithm of my own! Go check out my newest tutorial, KMStar! It goes pretty deep into explanations, so, hopefully, you’ll get a better understanding of how A* works! Yay!