forked from DhanushNehru/Hacktoberfest2025
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathn_queen.java
More file actions
42 lines (41 loc) · 1.23 KB
/
n_queen.java
File metadata and controls
42 lines (41 loc) · 1.23 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
import java.util.*;
import java.io.*;
public class n{
public static void main(String[] args) throws Exception{
Scanner scn = new Scanner(System.in);
int n=scn.nextInt();
int[][] chess = new int[n][n];
printNQueens(chess,"",0);
}
public static void printNQueens(int[][] chess, String psf, int row){
if(row == chess.length){
System.out.println(psf + ".");
return;
}
for(int col =0; col<chess.length;col++){
if(isQueenSafee(chess,row,col)== true){
chess [row][col]=1;
printNQueens(chess, psf + row + "-" +col + ",", row+1);
chess[row][col]=0;
}
}
}
public static boolean isQueenSafee(int[][] chess ,int row, int col){
for(int i=row-1, j=col ; i>=0;i--){
if(chess[i][j] == 1){
return false;
}
}
for(int i=row-1 , j=col-1 ; i>=0&& j>=0;i--,j--){
if(chess[i][j] == 1){
return false;
}
}
for(int i=row-1 , j=col+1 ; i>=0 && j<chess.length;i--,j++){
if(chess[i][j]==1){
return false;
}
}
return true;
}
}