I recently implemented A* pathfinding and I made a tutorial video explaining how I did it, along with the things I did to increase performance. Here is the video. I couldn’t find any other tutorials worth mentioning here; has anyone else implemented pathfinding in a better way? I’m getting pretty excellent performance with this method, but I have heard of other cool ways to do pathfinding such as navigation mesh. Let me know what you think, along with any other tips you have on how to implement A* or other pathfinding techniques you have used in the past. I welcome criticism on my video in general also; I’m still new at tutorial making.
For more information about Nauticus, check out our Nauticus blog.
I liked the video, been looking for ways to improve my a* implementation, and I knew using a heap would be the best way, so I will look into how you accomplished it when i have a chance.
But I think? In the video you said it doesn’t always return the shortest path, a* when implemented correctly with an admissible heuristic always returns the shortest path if a path is possible. Other than that what you talked about sounded good to me, I’ll probably check out the source code tomorrow to see if I can learn any lessons from it to improve my implementation. Thanks for the tutorial.
Thanks for watching! I hope the code is organized enough for you to understand. I didn’t write it for maintainability. You’re right about A* being optimal if an admissible heuristic is used. I meant mine wasn’t because I used Manhattan Distance. Thanks again for the feed back, I plan on doing another video on implementing and scaling health bars.