N皇后问题

最新推荐文章于 2024-09-06 10:38:06 发布

lwxwd

最新推荐文章于 2024-09-06 10:38:06 发布

阅读量74

点赞数

分类专栏：回溯笔记文章标签：深度优先算法图论

本文链接：https://blog.csdn.net/lwxwd/article/details/128166150

版权

笔记同时被 2 个专栏收录

30 篇文章 0 订阅

订阅专栏

回溯

6 篇文章 0 订阅

订阅专栏

//N皇后
#include<iostream>
using namespace std;
int n = 8, vis1[8]/*标记列*/, vis2[16]/*标记左上到右下（i-j+4）*/, vis3[16]/*标记左下到右上（i+j）*/;
int a[8][8];
int ans = 0;
void vis(int i, int j, bool flag) {//标记函数
	a[i][j] = flag;
	vis1[j] = flag;
	vis2[i - j + n] = flag;
	vis3[i + j] = flag;
}
void dfs(int i)//针对当前行
{
	if (i == n) {//搜满打印
		printf("NO.%d\n", ++ans);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) 
				printf("%d ", a[i][j]);
			printf("\n");
		}
	}
	for (int j = 0; j < n; j++) {//搜列
		if (!vis1[j] && !vis2[i - j + n] & !vis3[i + j]) {
			vis(i, j, 1);
			dfs(i + 1);
			vis(i, j, 0);
		}
	}
}
int main()
{
	dfs(0);
	return 0;
}

输出（举例）

NO.1
1 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 1
0 0 0 0 0 1 0 0
0 0 1 0 0 0 0 0
0 0 0 0 0 0 1 0
0 1 0 0 0 0 0 0
0 0 0 1 0 0 0 0
NO.2
1 0 0 0 0 0 0 0
0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 1
0 0 1 0 0 0 0 0
0 0 0 0 0 0 1 0
0 0 0 1 0 0 0 0
0 1 0 0 0 0 0 0
0 0 0 0 1 0 0 0
NO.3
1 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0
0 0 0 1 0 0 0 0
0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 1
0 1 0 0 0 0 0 0
0 0 0 0 1 0 0 0
0 0 1 0 0 0 0 0
......