-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathNQueen.cpp
71 lines (64 loc) · 1.43 KB
/
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
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
bool isSafe(vector<vector<bool>> &board, int row, int col, int N)
{
int r, c;
//check left col
for (c = 0; c < col; c++)
{
if (board[row][c])
return false;
}
//check upper left diagonal
for (r = row, c = col; r >= 0 && c >= 0; r--, c--)
{
if (board[r][c])
return false;
}
//check lower left diagonal
for (r = row, c = col; c >= 0 && r < N; r++, c--)
if (board[r][c])
return false;
return true;
}
bool generateNQueenBoardHelper(vector<vector<bool>> &board, int col, int N)
{
if (col >= N)
return true;
for (int row = 0; row < N; row++)
{
if (isSafe(board, row, col, N))
{
board[row][col] = true;
if (generateNQueenBoardHelper(board, col + 1, N))
return true;
// backtracking step
board[row][col] = false;
}
}
return false;
}
bool generateNQueenBoard(int N)
{
vector<vector<bool>> board(N, vector<bool>(N, false));
if (!generateNQueenBoardHelper(board, 0, N))
{
return false;
}
else
{
for (vector<bool> row : board)
{
for (int cell : row)
{
cout << (cell == true ? 1 : 0) << "\t";
}
cout << "\n";
}
return true;
}
}
int main()
{
generateNQueenBoard(8);
}