private Node findBestNode(){
        Node best = open.get (0);

        for (int i = 0; i < open.size(); i++){
            Node temp = open.get (i);
            if (best.getFinalCost() > temp.getFinalCost()){
                best = temp;
            }
        }
        return best;
    }