-
Notifications
You must be signed in to change notification settings - Fork 0
/
nqueen.cpp
61 lines (56 loc) · 865 Bytes
/
nqueen.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
#include<iostream>
#include<math.h>
using namespace std;
int board[20],count;
void print(int n)
{
int i,j;
cout<<"\nSolution "<<++count<<":\n";
for(i=1;i<=n;++i)
{
cout<<i;
for(j=1;j<=n;++j)
{
if(board[i]==j)
cout<<"\tQ";
else
cout<<"\t-";
}
cout<<"\n";
}
}
int place(int row,int column)
{
int i;
for(i=1;i<=row-1;i++)
{
if(board[i]==column)
return 0;
if(abs(board[i]-column)==abs(i-row))
return 0;
}
return 1;
}
void queen(int row,int n)
{
int column;
for(column=1;column<=n;column++)
{
if(place(row,column))
{
board[row]=column;
if(row==n)
print(n);
else
queen(row+1,n);
}
}
}
int main()
{
int n;
cout<<"Enter number of Queens:";
cin>>n;
queen(1,n);
return 0;
}