-
Notifications
You must be signed in to change notification settings - Fork 0
/
N-Queen_Problem.cpp
73 lines (72 loc) · 1.31 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
#include<iostream>
using namespace std;
bool is_Safe(int board[][10], int i, int j, int n)
{
for(int row=0; row<n; row++)
{
if(board[row][j]==1)
{
return false;
}
}
int x=i,y=j;
while(x>=0 && y>=0)
{
if(board[x][y]==1)
return false;
x--;
y--;
}
x=i;
y=j;
while(x>=0 && y>=0)
{
if(board[x][y]==1)
return false;
x--;
y++;
}
return true;
}
bool Place_N_Queen(int board[][10], int i, int n)
{
if(i==n)
{
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(board[i][j]==1)
{
cout<<board[i][j]<<" ";
}
else
{
cout<<"0"<<" ";
}
}
cout<<endl;
}
cout<<endl;
return false;
}
for(int j=0; j<n; j++)
{
if(is_Safe(board,i,j,n))
{
board[i][j]=1;
bool next_place=Place_N_Queen(board, i+1, n);
if(next_place)
return true;
board[i][j]=0;
}
}
return false;
}
int main()
{
int n;
cin>>n;
int board[10][10]={0};
Place_N_Queen(board, 0, n);
}