Рет қаралды 710
I've finished off the pathing calculation that utilizes the A* algorithm with a Euclidian heuristic. It works incredibly well and takes about 0.1ms to path 1 unit at the longest distance I could find. I also made a tool which bakes adjacency info which after heavy optimizing takes about 20 mins to compute all adjacencies. I use this data to calculate the pathing.