递归应用-八皇后问题（Java实现）

public class EightQueen {
    public static void main(String[] args) {
        int[][] queenboard = new int[8][8];
        int[][] attackboard = new int[8][8];

        Queen q1 = new Queen();
        q1.initboard(queenboard);
        q1.initboard(attackboard); 

        // q1.putqueen(4, 5, attackboard);

        // System.out.println("====queenboard====");
        // q1.printboard(queenboard);
        // System.out.println();

        // System.out.println("====attackboard====");
        // q1.printboard(attackboard);
        // System.out.println();

        q1.rollback(queenboard, attackboard, 0, 8);
    }
}

class Queen {
    public static int count = 0;
    public void initboard(int board[][]) {
        for (int i = 0; i < board.length; i++){ 
            for (int j = 0; j < board[i].length; j++) {
                board[i][j] = 0;
            }
        }
    }

    public void printboard(int board[][]) {
        for (int i = 0; i < board.length; i++){ 
            for (int j = 0; j < board[i].length; j++) {
                System.out.print(board[i][j] + " ");
            }
            System.out.println();
        }
    }
        //在（x,y）放置皇后，对attack数组进行更新
    public void putqueen(int x, int y, int attack[][]) {
        int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
        int dy[] = {1, 0, -1, 1, -1, 1, 0, -1};
        attack[x][y] = 1;

        //通过两层循环来更新皇后攻击范围
        for (int i = 1; i < attack.length; i++) {
            for (int j = 0; j < 8; j++) {    //8个攻击方向
                    int nx = x + i*dx[j];    //攻击横坐标
                    int ny = y + i*dy[j];    //攻击纵坐标

                if (nx >= 0 && nx < attack.length && ny >= 0 && ny < attack[0].length) {
                    attack[nx][ny] = 1;
                }
            }
        }  
    }
        //k表示当前处理的行
        //queen存储皇后的位置
        //attack存储攻击范围 
        //n表示N皇后问题
    public void rollback(int[][] queen, int[][] attack, int k, int n) {
        
        int tmp[][] = new int[8][8];

        if (k == n) {
            count = count + 1;
            System.out.println("========第"+ count +"种解法为==========");
            printboard(queen);
            return;
        }
        for (int i = 0; i < 8; i++) {
            if (attack[k][i] == 0) {
                for (int j = 0; j < attack.length; j++) {
                    for (int l = 0; l < attack[j].length; l++) {
                        tmp[j][l] = attack[j][l];
                    }
                }                                //备份attack数组
                queen[k][i] = 1;
                putqueen(k, i, attack);
                rollback(queen, attack, k+1, n);
                for (int j = 0; j < attack.length; j++) {
                    for (int l = 0; l < attack[j].length; l++) {
                        attack[j][l] = tmp[j][l];
                    }
                }    
                queen[k][i] = 0;
            }
        }
        return;
    }

}