I'm building a plugin for a game(RuneScape/RuneLite) to be used to display the shortest/best path to a target.
Pathfinding works great in Dijkstra/Greedy-AStar but I want to limit it to look in the region it's headed/or just not look all over the place to make pathfinding faster (under 300ms).
What's the problem? My AStar Algorithm, I think the Heuristic Calculation is wrong or needs modification. Any help will be greatly appreciated.