-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEightQueen.cpp
More file actions
80 lines (68 loc) · 1.54 KB
/
EightQueen.cpp
File metadata and controls
80 lines (68 loc) · 1.54 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
using namespace std;
int num;
bool ifillegal(bool **matrix,int n,int x,int y)
{
for(int i = 0;i < n;++i){
if(matrix[x][i] || matrix[i][y]) return false;
}
int i = x,j = y;
while(i > -1 && i < 8 && j > -1 && j < 8){
if(matrix[i--][j--]) return false;
}
i = x,j = y;
while(i > -1 && i < 8 && j > -1 && j < 8){
if(matrix[i--][j++]) return false;
}
i = x,j = y;
while(i > -1 && i < 8 && j > -1 && j < 8){
if(matrix[i++][j--]) return false;
}
i = x,j = y;
while(i > -1 && i < 8 && j > -1 && j < 8){
if(matrix[i++][j++]) return false;
}
return true;
}
void display(bool **matrix,int n)
{
for(int i = 0;i < n;++i){
for(int j = 0;j < n;++j){
if(matrix[i][j]) cout << "*" << " ";
else cout << matrix[i][j] << " ";
}
cout << endl;
}
}
void eightQueen(bool ** matrix,int n,int k)
{
if(k == n ) {
num++;
if(num == 2){
display(matrix,n);
cout << '\n';
}
}
else{
for(int i = 0;i < n;++i){
if(ifillegal(matrix,n,k,i)){
matrix[k][i] = 1;
eightQueen(matrix,n,k+1);
matrix[k][i] = 0;
}
}
}
}
int main()
{
bool **existion = new bool*[8];
for(int i = 0;i < 8;++i){
existion[i] = new bool[8];
}
eightQueen(existion,8,0);
for(int i = 0;i < 8;++i){
delete []existion[i];
}
delete []existion;
return 0;
}