八皇后

//八皇后
public class Queue8 {
    int max=8;
    int arr[] = new int[max];

  static   int count  = 0;
    public static void main(String[] args) {
        Queue8 queue8=new Queue8();
        queue8.check(0);
        System.out.println(count);
    }

    public void check(int n){
        if (n==max){
            print();
            return;
        }
        for (int i=0;i<max;i++){
            arr[n] = i;
            if (judge(n)){
               check(n+1);
            }
        }
    }
    public boolean judge(int n){
        for (int i=0;i<n;i++){
            if (arr[i]==arr[n]||Math.abs(i-n) == Math.abs(arr[i]-arr[n])){
                return false;
            }
        }
        return true;
    }
    
    //输出
    public void print(){
        count++;
        for (int i=0;i<max;i++){
            System.out.print(arr[i]+"\t");
        }
        System.out.println();
    }
}