By: Pieter Geerkens
FYI: I have been building a pathfinder for my HexgridUtilities library, and recently added an ALT (A* with Landmark Triangulation) implementation. This resulted in an 80-fold (yes, eighty!) speed...
View ArticleBy: Pieter Geerkens
I saw about 5-10% time reduction using the HOT-queue implementation, which is less tan the 30-50% I anticipated; I may have an inefficiency somewhere in the code. The preprocessing of my 760×420 map...
View ArticleBy: BlueRaja
Hey Pieter – thanks for the response! ALT is one of many techniques that can be used to speed up A* pathfinding. Some (like ALT) require expensive pre-processing, others require none. They are not all...
View ArticleBy: DanglingNeuron
Do you have an A* implementation in C# that can use this priority queue? I need A* for a tank game I am working , th elevels are simple, 100×100 units flat 2d surface with walls and obstacles. I have...
View Article
