-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAllSolutionsNQueenProblem.cpp
96 lines (75 loc) · 1.74 KB
/
AllSolutionsNQueenProblem.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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include<bits/stdc++.h>
using namespace std;
void print(vector<vector<int>> board){
for(int i=0;i<board.size();i++){
for(int j=0;j<board[i].size();j++){
cout<<board[i][j]<<" ";
}
cout<<endl;
}
cout<<endl;
}
bool isSafe(vector<vector<int>> board,int n,int row,int col){
// checking in row x cells
for(int i=0;i<n;i++){
if(board[row][i]==1){
return false;
}
}
// checking in column y
for(int i=0;i<n;i++){
if(board[i][col]==1){
return false;
}
}
// checking for diagonals
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if((i+j)==(row+col) && board[i][j]==1){
return false;
}
}
}
// checking for diagonals
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if((i-j)==(row-col) && board[i][j]==1){
return false;
}
}
}
return true;
}
bool NQueensUtil(int q,int col,vector<vector<int>> &board){
if( col >= q){
print(board);
return true;
}
bool res = false;
for(int i=0;i<q;i++){
if(isSafe(board,q,i,col)){
board[i][col] = 1;
res = NQueensUtil(q,col+1,board) || res;
board[i][col]=0;
}
}
return res;
}
vector<vector<int> > solveNQueens(int q) {
vector<vector<int>> board(q);
for(int i=0;i<q;i++){
for(int j=0;j<q;j++){
board[i].push_back(0);
}
}
int current = 0;
if(NQueensUtil(q,0,board) == false){
cout<<"Solution doest not exist"<<endl;
}
return board;
}
int main(){
int q = 4;
vector<vector<int>> ans = solveNQueens(q);
return 0;
}