Currently showing ../../pathfinder/PathFindingTutorial/target/src/org/newdawn/slick/util/pathfinding/heuristics/ Line Numbers: [show|hide]

package org.newdawn.slick.util.pathfinding.heuristics;

import org.newdawn.slick.util.pathfinding.AStarHeuristic;
import org.newdawn.slick.util.pathfinding.Mover;
import org.newdawn.slick.util.pathfinding.TileBasedMap;

 * A heuristic that uses the tile that is closest to the target
 * as the next best tile.
 * @author Kevin Glass
public class ClosestHeuristic implements AStarHeuristic {
	 * @see AStarHeuristic#getCost(TileBasedMap, Mover, int, int, int, int)
	public float getCost(TileBasedMap map, Mover mover, int x, int y, int tx, int ty) {		
		float dx = tx - x;
		float dy = ty - y;
		float result = (float) (Math.sqrt((dx*dx)+(dy*dy)));
		return result;


Total 27 Lines of Code.
Source code formatted using showsrc by William Denniss