Examples of pathfinder.heuristics.DiagonalNotEqual

pathfinder.heuristics.DiagonalNotEqual
This heuristic function calculates minimal cost for regular maps with square tiles which allow diagonal movements. It assumes that cost of diagonal movements is sqrt(2)*COST where COST is the cost of horizontal or vertical movement. @author Egor Tsinko @param < T> type of the point. Must extend java.awt.Point

    
  }
  
  public void testFindPathInMaze() 
  {
    finder.setHeuristic(new DiagonalNotEqual());
    List<Point> points = finder.findPath(new PathHelper(h1), new Point(0,0), new Point(6,6));
    
    assertTrue(points.size()==19);
    assertTrue(points.get(0).equals(new Point(0,1)));
    assertTrue(points.get(1).equals(new Point(1,2)));

View Full Code Here

    printPath(h1, points);
  }
  
  public void testFindPathDifferentCost() 
  {
    finder.setHeuristic(new DiagonalNotEqual());
    List<Point> points = finder.findPath(new PathHelper(h2), new Point(0,0), new Point(6,6));
    assertTrue(points.size()==8);
    
    //Check that algorithm crosses expensive part in the best place
    assertTrue(points.get(2).equals(new Point(3,1)));

View Full Code Here

    printPath(h2, points);  
  }
  
  public void testFailedSearch1()
  {
    finder.setHeuristic(new DiagonalNotEqual());
    List<Point> points = finder.findPath(new PathHelper(h3), new Point(0,0), new Point(6,6));
    assertTrue(points==null);
    //See that finder tried all possible tiles
    assertTrue(finder.getSteps()==21);
    assertTrue(finder.getVisitedPoints().size()==21);

View Full Code Here

    
  }


  public void testGetSteps() 
  {
    finder.setHeuristic(new DiagonalNotEqual());
    List<Point> points = finder.findPath(new PathHelper(h4), new Point(0,0), new Point(3,3));
    assertTrue(finder.getSteps()==4);
    assertTrue(points.size()==3);    
    assertTrue(points.get(0).equals(new Point(1,1)));
    assertTrue(points.get(1).equals(new Point(2,2)));

View Full Code Here

    printPath(h4, points);
  }
  
  public void testFailedSearch2()
  {
    finder.setHeuristic(new DiagonalNotEqual());
    List<Point> points = finder.findPath(new PathHelper(h5), new Point(0,0), new Point(2,2));
    assertTrue(points==null);
    //See that finder tried all possible tiles
    assertTrue(finder.getSteps()==3);
    assertTrue(finder.getVisitedPoints().size()==3);

View Full Code Here

  }


  
  public void testGetGVal()
  {
    finder.setHeuristic(new DiagonalNotEqual());
    finder.findPath(new PathHelper(h6), new Point(0,0), new Point(2,2));
    
    List<Point> closed = finder.getVisitedPoints();
    assertTrue(closed.size()!=0);

View Full Code Here

TOP

Related Classes of pathfinder.heuristics.DiagonalNotEqual

tests.PathFinderTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.