GreedyBestFirst.java

import java.awt.*;
import java.util.ArrayList;


class GreedyBestFirst {

    public static ArrayList<Space> findPath(Board board, Point start, Point end) {

        ArrayList<Space> path = new ArrayList<Space>();

        ArrayList<Space> frontier = new ArrayList<Space>();
        ArrayList<Space> visited = new ArrayList<Space>();
        Space starter = board.getSpace(start);
        Space ender = board.getSpace(end);
        starter.setDistFrom(0);
        starter.setDistTo(Math.abs(starter.getX()-ender.getX()) + Math.abs(starter.getY() - ender.getY()));
        frontier.add(starter);
        boolean found = false;
        Space curr = starter;
        while(!found && !frontier.isEmpty())
        {
        	curr = frontier.remove(0);
            System.out.println("[" + curr.getX() + "," + curr.getY() + "] ");
            if(curr.getX() == ender.getX() && curr.getY() == ender.getY())
            {
                found = true;
                break;
            }
            for(Space neighbor : board.getNeighbors(curr))
            {
                boolean alreadyVisited = false;
                if(visited.contains(neighbor))
                    alreadyVisited = true;
                if(frontier.contains(neighbor))
                    alreadyVisited = true;
                if(!alreadyVisited)
                {
                    neighbor.setPrevious(curr);
                    neighbor.setDistFrom(0);
                    neighbor.setDistTo(Math.abs(neighbor.getX()-ender.getX()) + Math.abs(neighbor.getY() - ender.getY()));
                    frontier.add(neighbor);
                }
            }
            frontier.sort(null);
            visited.add(curr);
        }
        if(curr.compareTo(ender) == 0)
        {
            while(curr.getPrevious() != null)
                {
                path.add(curr);
                curr.setType(SpaceType.PATH);
                curr = curr.getPrevious();
            }
        }
        return path;
    }
}