1832 - 八皇后问题

最新推荐文章于 2024-05-28 15:36:02 发布

~Carlos

最新推荐文章于 2024-05-28 15:36:02 发布

阅读量1.2k

点赞数 30

文章标签：算法

本文链接：https://blog.csdn.net/delia781290/article/details/135704905

版权

题目详见:1832 - 八皇后问题-东方博宜OJ

题目描述

在国际象棋棋盘上放置八个皇后，要求每两个皇后之间不能直接吃掉对方。

输入

无输入。

输出

按给定顺序和格式输出所有八皇后问题的解（见Sample Output）。

样例

输入

复制

输出

复制

No. 1
1 0 0 0 0 0 0 0 
0 0 0 0 0 0 1 0 
0 0 0 0 1 0 0 0 
0 0 0 0 0 0 0 1 
0 1 0 0 0 0 0 0 
0 0 0 1 0 0 0 0 
0 0 0 0 0 1 0 0 
0 0 1 0 0 0 0 0 
No. 2
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 
No. 3
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. 4
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. 5
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 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 
No. 6
0 0 0 1 0 0 0 0 
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 1 0 0 0 0 0 0 
0 0 0 0 0 0 1 0 
0 0 1 0 0 0 0 0 
0 0 0 0 0 1 0 0 
No. 7
0 0 0 0 1 0 0 0 
1 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 1 
0 0 0 1 0 0 0 0 
0 1 0 0 0 0 0 0 
0 0 0 0 0 0 1 0 
0 0 1 0 0 0 0 0 
0 0 0 0 0 1 0 0 
No. 8
0 0 1 0 0 0 0 0 
1 0 0 0 0 0 0 0 
0 0 0 0 0 0 1 0 
0 0 0 0 1 0 0 0 
0 0 0 0 0 0 0 1 
0 1 0 0 0 0 0 0 
0 0 0 1 0 0 0 0 
0 0 0 0 0 1 0 0 
No. 9
0 0 0 0 1 0 0 0 
1 0 0 0 0 0 0 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 0 0 1 0 
0 0 1 0 0 0 0 0 
...以下省略

说明

此题可使用函数递归调用的方法求解。

———————————————————————————————————————————

这道题目其实挺简单的，具体思路我就不讲了，直接上代码，管你看的看不懂！

#include<bits/stdc++.h>
using namespace std;
int a[100][100], b[100], vis[100][100], tot;
int dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, { -1, 0}};
void queen(int step);
int main() {
	queen(1);
	for (int t = 1; t <= tot; t++) {
		printf("No. %d\n", t);
		for (int i = 1; i <= 8; i++) {
			for (int j = 1; j <= 8; j++) {
				if (a[t][j] == i)
					cout << "1 ";
				else
					cout << "0 ";
			}
			cout << endl;
		}
	}
	return 0;
}
void queen(int step) {
	if (step == 8 + 1) {
		tot++;
		for (int i = 1; i <= 8; i++)
			a[tot][i] = b[i];
		return;
	}
	for (int i = 1; i <= 8; i++) {
		if (vis[0][i] == 0 && vis[1][step + i] == 0 && vis[2][step - i + 8] == 0) {
			vis[0][i] = 1;
			vis[1][i + step] = 1;
			vis[2][step - i + 8] = 1;
			b[step] = i;
			queen(step + 1);
			vis[0][i] = 0;
			vis[1][i + step] = 0;
			vis[2][step - i + 8] = 0;
		}
	}
}