-
Notifications
You must be signed in to change notification settings - Fork 39
/
Nqueens
75 lines (73 loc) · 1.94 KB
/
Nqueens
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 nqueens {
public static boolean issafe(char board[][],int row,int col)
{//is it safe to place queen
//return true if it is safe
//vertically up //col will be same
for(int i = row-1,j=col;i>=0;--i)
{
if(board[i][j]=='Q')
{
return false;
}
}
//diag left up//col will decrease and row will also decrease
for(int i = row-1,j=col-1;i>=0&&j>=0;--i,--j)
{
if(board[i][j]=='Q')
{
return false;
}
}
//diagonally right up // col will increase and row will decrease
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 nqueens1(char board[][],int row)
{
//base
if(row==board.length)
{
printBoard(board);
return;
}
//column loop
for(int j=0;j<board.length;++j)
{
if(issafe(board, row,j))
{board[row][j] = 'Q';//putting queen
nqueens1(board, row+1);//fxn call for next row
board[row][j]='X';//removing queen//backtracking
}
}
}
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();
}
}
public static void main(String[] args) {
int n = 4;
char board[][]= new char[n][n];
for(int i=0;i<n;++i)
{
for(int j =0;j<n;++j)
{
board[i][j] = 'X';
}
}
nqueens1(board,0);
}
}