马踏棋盘：贪心算法java实现

import java.util.ArrayList;
import java.util.LinkedList;

class Horse {
	private boolean board[][] = new boolean[8][8];//棋盘
	private LinkedList<Point> steps = new LinkedList<Point>();//马儿的足迹
	private Point vector[] = new Point[]{new Point(1,2),new Point(-1,-2),
			new Point(-1,2),new Point(1,-2),new Point(2,1),
			new Point(-2,-1),new Point(-2,1),new Point(2,-1)};//走下一步的增量
	
	public void start(Point start){
		System.out.println();
		System.out.println("从"+start.toString()+"开始寻找。。。。");
		goTo(start);
		while(true){
			Point temp = getBestNext(steps.getLast());
			if(temp.getX()==-1)
				break;//结束或失败
			else
				goTo(temp);
		}
		displayboard();
	}
	private void goTo(Point p){//去下一步
		steps.add(p);
		board[p.getX()][p.getY()] = true;
	}
	private Point getBestNext(Point p){
		int temp =9;
		Point best = new Point();
		
		ArrayList<Point> list = foundNext(p);
		
		for (int i