Java 算法分析 骑士周游问题（回溯算法）

public class KnightTravel {
   
    private static int X;//棋盘的行
    private static int Y;//棋盘的列
    //记录所有的棋盘位置是否走过
    private static boolean[] isKnightTravel;
    //记录是否全部走完
    private static boolean finish;
    public static void main(String[] args) {
   
        X=6;
        Y=6;
        int x=1;
        int y=6;
        int[][]chessBoard=new int[X][Y];
        isKnightTravel=new boolean[X*Y];
        finish=false;
        knightTravel(chessBoard, x-1, y-1, 0);
        for (int[] ints : chessBoard) {
   
            System.out.println(Arrays.toString