com.b3dgs.lionengine.game.pathfinding
Interface AStarHeuristic

All Known Implementing Classes:
ClosestHeuristic, ClosestSquaredHeuristic, ManhattanHeuristic

public interface AStarHeuristic


Method Summary
 float getCost(PathBasedMap<? extends AbstractPathTile> map, Pathfindable mover, int x, int y, int tx, int ty)
          This controls the order in which tiles are searched while attempting to find a path to the target location.
 

Method Detail

getCost

float getCost(PathBasedMap<? extends AbstractPathTile> map,
              Pathfindable mover,
              int x,
              int y,
              int tx,
              int ty)
This controls the order in which tiles are searched while attempting to find a path to the target location. The lower the cost the more likely the tile will be searched.

Parameters:
map - map on which the path is being found.
mover - entity that is moving along the path.
x - x coordinate of the tile being evaluated.
y - y coordinate of the tile being evaluated.
tx - x coordinate of the target location.
ty - y coordinate of the target location.
Returns:
cost associated with the given tile.