-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSudoku.java
More file actions
131 lines (120 loc) · 4.16 KB
/
Copy pathSudoku.java
File metadata and controls
131 lines (120 loc) · 4.16 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
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
package sudoko.game;
/**
*
* @Aneeqa
*/
//Main Class
public class SudokuGame {
//n is the size of grid that n*n
static int n=9;
/*This method takes partially filled grid and then try to assign number
un assigned locations in way that fulfill sudoko solution requirements also*/
static boolean SudokuSolver(int grid[][],int Row ,int Col){
/*if we have at the 8th row and 9th column
we avoid further backtracking */
if(Row==n-1 && Col==n){
return true;
}
// Check if column value becomes 9,we move to next row
//and column start from 0
if (Col == n) {
Row++;
Col = 0;
}
//if the current position of the grid already
//contains value >0, we iterate for next column
if (grid[Row][Col] != 0)
return SudokuSolver(grid, Row, Col + 1);
for (int Num = 1; Num < 10; Num++) {
// Check if it is correct to place the num (1-9)
//in the given row ,col-->we move to next column
if (isCorrect(grid, Row, Col,Num)) {
/*Assigning the num in the current
(row,col) position of the grid and
assuming our assigned num in the position
is correct */
grid[Row][Col] = Num;
// Checking for next possibility with next column
if (SudokuSolver(grid, Row, Col + 1))
return true;
}
/* Remove the number as our assumption was wrong
and move to the next assumption
*/
grid[Row][Col] = 0;
}
return false;
}
// function to print the grid of sudoku Game
static void print(int[][] grid){
System.out.println("'Sudoku Game Solver'");
System.out.println("--------------------------");
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++){
System.out.print(grid[i][j] + " ");
}
System.out.println("");
}
System.out.println("--------------------------");
}
// Check is it legal to assign number to the given row and column
static boolean isCorrect(int[][] grid, int Row, int Col,
int num)
{
// if we find the same num in the similar row,we return false
for (int x = 0; x <= n-1; x++)
if (grid[Row][x] == num)
return false;
// Check if we find the same num in the similar col,we return false
for (int x = 0; x <= n-1; x++)
{
if (grid[x][Col] == num){
return false;
}
}
/* Check if we find the same num in the particular 3*3
matrix, we 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;
}
return false;
}
}
package sudoko.game;
import static sudoko.game.SudokuGame.SudokuSolver;
import static sudoko.game.SudokuGame.print;
/**
*
* @Aneeqa
*/
//Driver Class
public class SudokuTest {
// Driver Code
public static void main(String[] args)
{
int grid[][] = { { 0, 0, 0, 2, 6, 0, 7, 0, 1 },
{ 6, 8, 0, 0, 7, 0, 0, 9, 0 },
{ 1, 9, 0, 0, 0, 4, 5, 0, 0 },
{ 8, 2, 0, 1, 0, 0, 0, 4, 0 },
{ 0, 0, 4, 6, 0, 2, 9, 0, 0 },
{ 0, 5, 0, 0, 0, 3, 0, 2, 8 },
{ 0, 0, 9, 3, 0, 0, 0, 7, 4 },
{ 0, 4, 0, 0, 5, 0, 0, 3, 6 },
{ 7, 0, 3, 0, 1, 8, 0, 0, 0 }
};
if (SudokuSolver(grid, 0, 0)){
print(grid);
}
else{
System.out.println("Sorry! No Solution ");
}
}
// Reference use in this code:https://www.geeksforgeeks.org/sudoku-backtracking-7//
}