-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNQueens.java
More file actions
66 lines (55 loc) · 1.65 KB
/
NQueens.java
File metadata and controls
66 lines (55 loc) · 1.65 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
import java.io.*;
public class NQueens {
static int queens(boolean[][] board, int row){
if(row == board.length){
display(board);
System.out.println();
return 1;
}
int count =0;
for(int col = 0; col< board.length ; col++){
if(isSafe(board, row, col)){
board[row][col]=true;
count = count + queens(board, row+1);
board[row][col] = false;
}
}
return count;
}
static boolean isSafe(boolean[][] board, int row, int col){
for(int i = 0; i <row ;i++){
if(board[i][col])
return false;
}
int minLeft = Math.min(row, col);
for(int i = 1; i<=minLeft; i++){
if(board[row-i][col-i]){
return false;
}
}
int minRight = Math.min(row, board.length - col -1);
for(int i = 1; i<=minRight; i++){
if(board[row-i][col+i]){
return false;
}
}
return true;
}
static void display(boolean[][] board){
for(boolean[] row: board){
for(boolean element: row){
if(element){
System.out.print("Q ");
}
else{
System.out.print("X ");
}
}
System.out.println();
}
}
public static void main(String[] args){
boolean[][] board = new boolean[4][4];
System.out.println(queens(board ,0));
}
}