八皇后问题

public class Queen {
static int N =8;
static int column[] = new int[N + 1]; // 同栏是否有皇后，1表示有
static int rup[] = new int[2 * N + 1]; // 右上至左下是否有皇后
static int lup[] = new int[2 * N + 1]; // 左上至右下是否有皇后
static int queen[] = new int[N + 1];


static int num = 0; // 解答编号


public static void main(String[] args) {
int i;
num = 0;
for (i = 1; i <= N; i++)
column[i] = 1;
for (i = 1; i <= 2 * N; i++)
rup[i] = lup[i] = 1;
backtrack(1);
}


static void showAnswer() {
int x, y;
System.out.println("解答 " + ++num);
for (y = 1; y <= N; y++) {
for (x = 1; x <= N; x++) {
if (queen[y] == x) {
System.out.print(" Q");
} else {
System.out.print(" .");
}
}
System.out.println("\n");
}
}


static void backtrack(int i) {
int j;
if (i > N) {
showAnswer();
} else {
for (j = 1; j <= N; j++) {
if (column[j] == 1 && rup[i + j] == 1 && lup[i - j + N] == 1) {
queen[i] = j;
// 设定为占用
column[j] = rup[i + j] = lup[i - j + N] = 0;
backtrack(i + 1);
column[j] = rup[i + j] = lup[i - j + N] = 1;
}
}
}
}
}