Hierarchical-Pathfinding Explained

This video goes over how the algorithm and implementation works in much more detail. I do not fully explain everything, but I do explain the most important parts of how the algorithm works. The source code can be found on my GitHub: github.com/Azuronis Instead of having your pathfinding algorithm struggle through massive maps, this approach splits everything into manageable pieces. Think of it like continuous short distance pathfinding - you don't path find from start to finish and get a full, finished path. You figure out which chunks need to be accessed, and form a plan based on that. Once you have a plan, you can path find to each step one at a time. Since materials on this algorithm online are scarce, I decided to create an open-source demo available to anyone. Not all of the paths in this video are optimal at the moment. You will notice that some paths are somewhat bad. This is mainly due to unedited heuristics, and and no line-of-site algorithm implementation yet. With these updates that are soon-to-be added, the algorithm will perform much better. Socials - - Github: github.com/Azuronis - Discord: Azuronis - Email: [email protected]