-
Notifications
You must be signed in to change notification settings - Fork 0
/
sudokuSolver.java
75 lines (73 loc) · 2.17 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
class Result {
static int N=9;
static int solveSudoku(int[][] grid)
{
if (solve(grid,0,0))
{
return 1;
}
else
{
return -1;
}
}
static void print(int[][] grid)
{
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++)
System.out.print(grid[i][j] + " ");
System.out.println();
}
}
static boolean solve(int[][] grid,int row,int col)
{
if (row == N - 1 && col == N)
return true;
if (col == N) {
row++;
col = 0;
}
if (grid[row][col] != 0)
return solve(grid,row,col + 1);
for (int num = 1; num < 10; num++) {
if (isSafe(grid, row, col, num)) {
grid[row][col] = num;
if (solve(grid, row, col + 1))
return true;
}
grid[row][col] = 0;
}
return false;
}
static boolean isSafe(int[][] grid, int row, int col,int num)
{
for (int x = 0; x <= 8; x++)
if (grid[row][x] == num)
return false;
for (int x = 0; x <= 8; x++)
if (grid[x][col] == num)
return false;
int startRow = row - (row % 3), startCol = col - (col % 3);
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++)
if (grid[i + startRow][j + startCol] == num)
return false;
return true;
}
public static void main(String[] args)
{
int grid[][] = { { 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 (solveSuduko(grid)==1)
print(grid);
else
System.out.println("No Solution exists");
}
}