java运用递归回溯知识实现走迷宫问题

public class MiGon {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
				int[][] map = new int[8][7];
				
				for (int i = 0; i < 7; i++) {
					map[0][i] = 1;
					map[7][i] = 1;
				}

				for (int i = 0; i < 8; i++) {
					map[i][0] = 1;
					map[i][6] = 1;
				}
				map[3][1] = 1;
				map[3][2] = 1;
				find(map,1,1);
				for (int i = 0; i < 8; i++) {
					for (int j = 0; j < 7; j++) {
						System.out.print(map[i][j]+" ");
					}
					System.out.println();
				}
			
	}
		
	public static boolean find(int map[][],int x,int y) {
		if(map[6][5]==2) {
			return true;
		}
		if(map[x][y]==0) {
			map[x][y]=2;
			if(find(map,x+1,y)) {
				return true;
			}
			if(find(map,x,y+1)) {
				return true;
			}
			if(find(map,x-1,y)) {
				return true;
			}
			if(find(map,x,y-1)) {
				return true;
			}
		}	
		map[x][y]=3;
		return false;
	}
}

运行结果：

1 1 1 1 1 1 1 
1 2 0 0 0 0 1 
1 2 2 2 0 0 1 
1 3 3 2 0 0 1 
1 0 0 2 0 0 1 
1 0 0 2 0 0 1 
1 0 0 2 2 2 1 
1 1 1 3 3 1 1