- All Known Implementing Classes:
public interface AStarHeuristic
double getEstimatedDistanceToGoal(Node a,
- The heuristic tries to guess how far a given Node is from the goal Node.
The lower the cost, the more likely a Node will be searched next.
map - The map on which the path is being found
x - The x coordinate of the tile being evaluated
y - The y coordinate of the tile being evaluated
tx - The x coordinate of the target location
ty - The y coordinate of the target location
- The cost associated with the given tile