-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathN_queens.java
More file actions
75 lines (68 loc) · 2.08 KB
/
Copy pathN_queens.java
File metadata and controls
75 lines (68 loc) · 2.08 KB
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
public class N_queens {
public static void nQueens(char board[][], int row) {
// base
if (row == board.length) {
// printBoard(board);
count ++;
return;
}
// //column
// for(int j = 0;j<board.length;j++){
// board[row][j] = 'Q';
// nQueens(board, row+1);
// board[row][j] = 'x';
// }
// column loop
for (int j = 0; j < board.length; j++) {
if (isSafe(board, row, j)) {
board[row][j] = 'Q';
nQueens(board, row + 1);
board[row][j] = 'x';
}
}
}
public static boolean isSafe(char board [][], int row, int col){
// vertical up
for(int i = row - 1; i>= 0; i--){
if(board[i][col] == 'Q'){
return false;
}
}
// /diag up
for (int i = row-1, j=col-1;i>= 0 && j>= 0; i--, j--){
if(board[i][j] == 'Q'){
return false;
}
}
// diag right up
for(int i = row-1, j=col+1;i>=0 && j<board.length;i--,j++){
if(board[i][j]=='Q'){
return false;
}
}
return true;
}
public static void printBoard(char board[][]) {
System.out.println("-------chess board-------");
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board.length; j++) {
System.out.print(board[i][j] + " ");
}
System.out.println();
}
}
// count number of solutions
static int count = 0;
public static void main(String args[]) {
int n = 5;
char board[][] = new char[n][n];
// initialize
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
board[i][j] = 'x';
}
}
nQueens(board, 0);
System.out.println("total ways to olve n queens = " + count);
}
}