-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPracticeQs3.java
More file actions
60 lines (52 loc) · 1.67 KB
/
PracticeQs3.java
File metadata and controls
60 lines (52 loc) · 1.67 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
public class PracticeQs3 {
static int N = 8;
public static boolean isSafe(int x, int y, int sol[][]) {
return (x >= 0 && x < N && y >= 0 && y < N && sol[x][y] == -1);
}
public static void printSolution(int sol[][]) {
for (int x = 0; x < N; x++) {
for (int y = 0; y < N; y++) {
System.out.print(sol[x][y] + " ");
}
System.out.println();
}
}
public static boolean solve() {
int sol[][] = new int[N][N];
for (int x = 0; x < N; x++) {
for (int y = 0; y < N; y++) {
sol[x][y] = -1;
}
}
int xMove[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int yMove[] = { 1, 2, 2, 1, -1, -2, -2, -1 };
sol[0][0] = 0;
if (!solveUtil(0, 0, 1, sol, xMove, yMove)) {
System.out.println("Solution does not exist");
return false;
} else
printSolution(sol);
return true;
}
public static boolean solveUtil(int x, int y, int movei, int sol[][], int xMove[], int yMove[]) {
int k, next_x, next_y;
if (movei == N * N) {
return true;
}
for (k = 0; k < 8; k++) {
next_x = x + xMove[k];
next_y = y + yMove[k];
if (isSafe(next_x, next_y, sol)) {
sol[next_x][next_y] = movei;
if (solveUtil(next_x, next_y, movei + 1, sol, xMove, yMove))
return true;
else
sol[next_x][next_y] = -1; // Backtracking
}
}
return false;
}
public static void main(String[] args) {
solve();
}
}