forked from Harry-003/Programs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnqueens.cpp
More file actions
116 lines (108 loc) · 2.07 KB
/
nqueens.cpp
File metadata and controls
116 lines (108 loc) · 2.07 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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
#include <iostream>
using namespace std;
bool isSafe(int arr[1000][1000], int x, int y, int n)
{
for (int i = 0; i < x; i++)
{
if (arr[i][y] == 1)
{
return false;
}
}
int row = x;
int col = y;
while (row >= 0 && col >= 0)
{
if (arr[row][col] == 1)
{
return false;
}
row--;
col--;
}
row = x;
col = y;
while (row >= 0 && col < n)
{
if (arr[row][col] == 1)
{
return false;
}
row--;
col++;
}
return true;
}
bool nQueen(int arr[1000][1000], int x, int n)
{
if (n <= 3)
{
cout << "No solution exists" << endl;
return true;
}
int cols = 0;
if (x >= n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (i == 0)
{
cols = j;
}
if (arr[i][j] == 1)
{
cout << i << "," << j;
arr[i][j] = 0;
}
}
cout << " ";
}
}
int col = 0;
if (cols >= n)
{
return true;
}
else
{
if (x == 0)
{
col = cols;
}
else
{
col = 0;
}
while (col < n)
{
if (isSafe(arr, x, col, n))
{
arr[x][col] = 1;
if (nQueen(arr, x + 1, n))
{
return true;
}
arr[x][col] = 0;
}
col++;
}
return false;
}
}
int main()
{
int n = 0;
cout << "Enter no of queens " << endl;
cin >> n;
int arr[1000][1000] = {};
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
arr[i][j] = 0;
}
}
cout<<nQueen(arr,0,n);
}