数据结构之八皇后问题（递归算法）

//八皇后问题

#include<stdio.h>

int count=0;//全局变量count

int notDanger(int row, int j, int(*chess)[8]) {
	int i,r,flat1=0,flat2=0,flat3=0,flat4=0,flat5=0;
	//判断纵列有没有其他皇后
	for (i = 0; i < 8; i++) {
		if (*(*(chess + i) + j) != 0) {
			flat1 = 1;
			break;
		}
	}

	//左上角
	for (i = row, r = j; i >= 0&&r >= 0; i--, r--) {
		if (*(*(chess + i) + j) != 0) {
			flat2 =1;
			break;
		}
	}

	//右上角
	for (i = row, r = j; i >= 0&&r < 8; i--, r++) {
		if (*(*(chess + i) + j) != 0) {
			flat3 = 1;
			break;
		}
	}

	//左下角
	for (i = row, r = j; i < 8&&r >= 0; i++, r--) {
		if (*(*(chess + i) + j) != 0) {
			flat4 = 1;
			break;
		}
	}

	//右下角
	for (i = row, r = j; i < 8&&r < 8; i++, r++) {
		if (*(*(chess + i) + j) != 0) {
			flat5 = 1;
			break;
		}
	}

	if (flat1 || flat2 || flat3 || flat4 || flat5) {
		return 0;
	}
	else {
		return 1;
	}
	
}

void EightQueen(int row, int n, int(*chess)[8]) {

	//创建chess2来打印chess的棋盘
	int chess2[8][8], i, j;
	for (i = 0; i < 8; i++) {
		for (j = 0; j < 8; j++) {
			chess2[i][j] = chess[i][j];
		}
	}

	//如果row=8，则表示棋盘已满，打印chess2条件已达成
	if (row == 8) {
		printf("第%d种情况：\n", count+1);
	for (i = 0; i < 8; i++) {
		for (j = 0; j < 8; j++) {
			printf("%d ", *(*(chess2+i)+j));
		}
		printf("\n");
	}
	printf("\n");
	count++;
}
	else {
		//判断皇后在该行是否有危险，没有则进行下一行
		for (j = 0; j < n; j++) 
		{
			if (notDanger(row, j, chess) )
			{
				for (i = 0; i < 8; i++)
				{
					*(*(chess2 + row) + i) = 0;
				}
				*(*(chess2 + row) + j) = 1;
				EightQueen(row + 1, n, chess2);
			}
		}
	}
}

int main() {
	int chess[8][8];
	int i, j;
	for (i = 0; i < 8; i++) {
		for (j = 0; j < 8; j++) {
			chess[i][j] = 0;
		}
	}

	EightQueen(0,8,chess);

	printf("总共有%d种方法。",count);
	
	return 0;

}

吐槽：这个玩意用递归真的难搞，花了好多时间，掉了好多头发。。。。。