-
Notifications
You must be signed in to change notification settings - Fork 0
/
N-Queen_Problem.cpp
76 lines (76 loc) · 1.23 KB
/
N-Queen_Problem.cpp
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
#include <iostream>
#include <stdlib.h>
using namespace std;
int place(int r,int c);
int NQueen(int r ,int n);
int print(int n);
int x[20],count;
int NQueen(int r,int n)
{
int c,i;
for(c=1;c<=n;c++)
{
if(place(r,c))
{
x[r]=c;
if(r==n)
{
print(n);
}
else
{
NQueen(r+1,n);
}
}
}
return 0;
}
int place(int r,int c)
{
int j;
for(j=1;j<=r-1;j++)
{
if(x[j]==c)//column
{
return 0;
}
else
{
if(abs(x[j]-c)==abs(j-r))//diagonal
{
return 0;
}
}
}
return 1;
}
int print(int n)
{
int i,j;
cout<<"\n\nSolution "<<++count<<"\n\n";
for(i=1;i<=n;i++)
{
cout<<"\t "<<i;
}
for(i=1;i<=n;i++)
{
cout<<"\n"<<i;
for(j=1;j<=n;j++)
{
if(x[i]==j)
cout<<"\t Q";
else
cout<<"\t -";
}
}
return 0;
}
int main()
{
int n;
cout<<"\n ****** N-Queen Solution *****\n";
cout<<"\n Enter the no. of Queen:-\n";
cin>>n;
NQueen(1,n);
return 0;
}