-
Notifications
You must be signed in to change notification settings - Fork 81
/
SudokuSolver.java
110 lines (95 loc) · 2.96 KB
/
SudokuSolver.java
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
/*=======Implementation of Sudoku solver in JAVA========*/
public class SudokuSolver {
public static void main(String[] args) {
int[][] board = new int[][]{
{3, 0, 6, 5, 0, 8, 4, 0, 0},
{5, 2, 0, 0, 0, 0, 0, 0, 0},
{0, 8, 7, 0, 0, 0, 0, 3, 1},
{0, 0, 3, 0, 1, 0, 0, 8, 0},
{9, 0, 0, 8, 6, 3, 0, 0, 5},
{0, 5, 0, 0, 9, 0, 6, 0, 0},
{1, 3, 0, 0, 0, 0, 2, 5, 0},
{0, 0, 0, 0, 0, 0, 0, 7, 4},
{0, 0, 5, 2, 0, 6, 3, 0, 0}
};
if (solve(board)) {
display(board);
} else {
System.out.println("Cannot solve");
}
}
static boolean solve(int[][] board) {
int n = board.length;
int row = -1;
int col = -1;
boolean emptyLeft = true;
// this is how we are replacing the r,c from arguments
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (board[i][j] == 0) {
row = i;
col = j;
emptyLeft = false;
break;
}
}
// if you found some empty element in row, then break
if (emptyLeft == false) {
break;
}
}
if (emptyLeft == true) {
return true;
// soduko is solved
}
// backtrack
for (int number = 1; number <= 9; number++) {
if (isSafe(board, row, col, number)) {
board[row][col] = number;
if (solve(board)) {
// found the answer
return true;
} else {
// backtrack
board[row][col] = 0;
}
}
}
return false;
}
private static void display(int[][] board) {
for(int[] row : board) {
for(int num : row) {
System.out.print(num + " ");
}
System.out.println();
}
}
static boolean isSafe(int[][] board, int row, int col, int num) {
// check the row
for (int i = 0; i < board.length; i++) {
// check if the number is in the row
if (board[row][i] == num) {
return false;
}
}
// check the col
for (int[] nums : board) {
// check if the number is in the col
if (nums[col] == num) {
return false;
}
}
int sqrt = (int)(Math.sqrt(board.length));
int rowStart = row - row % sqrt;
int colStart = col - col % sqrt;
for (int r = rowStart; r < rowStart + sqrt; r++) {
for (int c = colStart; c < colStart + sqrt; c++) {
if (board[r][c] == num) {
return false;
}
}
}
return true;
}
}