Well, folks, there you have it! This is our own implementation of the A* Algorithm! I hope you all enjoyed this tutorial and that it helps you at least get rolling with whatever you’re working on! This is only a simple implementation, and I wanted to give you all a lot of wiggle room to implement your own ideas. That said, the source code for this is available from my GitHub (link is at the bottom of the page).
I’d love to see what you guys do with it. Post up any questions, comments, slander, corrections, or even your own algorithms! You’ll find, in the source code, I’ve added a few new
HeuristicAlgorithm types that I didn’t even mention in this tutorial!And, below, are links and references that I used for writing the tutorial, and thought might help you all out as well.
That said, hope you all enjoyed, and happy trails!
- A* Search on Brilliant.org
- A* Pathfinding Algorithm on Growing With The Web
- CodeProject.com – Pathfinding Algorithms in C#
- GitHub – ActiveState’s Code Recipe: A* Shortest Path Algorithm