-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSudoku.java
More file actions
139 lines (115 loc) · 2.67 KB
/
Copy pathSudoku.java
File metadata and controls
139 lines (115 loc) · 2.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
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
128
129
130
131
132
133
134
135
136
137
138
139
/*************************************************************************
* Name: Uros Slana
* Email: urossla(at)gmail.com
*
* Compilation: Sudoku.java
* Dependencies:
*
* Description: Sudoku solver
*
* % java Sudoku grid.txt
* 0 0 0 8 0 1 0 0 0
* 0 0 0 0 0 0 4 3 0
* 5 0 0 0 0 0 0 0 0
* 0 0 0 0 7 0 8 0 0
* 0 0 0 0 0 0 1 0 0
* 0 2 0 0 3 0 0 0 0
* 6 0 0 0 0 0 0 7 5
* 0 0 3 4 0 0 0 0 0
* 0 0 0 2 0 0 6 0 0
*************************************************************************/
import java.io.File;
import java.util.Scanner;
import java.io.FileNotFoundException;
public class Sudoku {
public int[][] gridSolved;
public Sudoku(int[][] grid) {
gridSolved = new int [9][9];
int[][] gridZero = new int [9][9];
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
gridSolved[i][j] = grid[i][j];
gridZero[i][j] = grid[i][j];
}
}
find(gridZero);
}
private boolean find(int[][] grid) {
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (grid[i][j] == 0) {
int n = 1;
while (n <= 9) {
if (rowCol(n, i, j, grid) && square(n, i, j, grid)) {
grid[i][j] = n;
if (find(grid)) {
gridSolved[i][j] = n;
return true;
}
}
n++;
}
grid[i][j] = 0;
return false;
}
}
}
return true;
}
//check if row or col contain number
private boolean rowCol(int n, int iS, int jS, int[][] grid) {
for (int j = 0; j < 9; j++) {
if (grid[iS][j] == n || grid[j][jS] == n) {
return false;
}
}
return true;
}
//check if square contain number
private boolean square(int n, int i, int j, int[][] grid) {
for (int iS = (i/3)*3; iS < ((i/3)*3)+3; iS++) {
for(int jS = (j/3)*3; jS < ((j/3)*3)+3; jS++) {
if (grid[iS][jS] == n) {
return false;
}
}
}
return true;
}
public int[][] solution() {
return gridSolved;
}
public static void main(String[] args) {
if (args.length < 1) {
System.out.println("Incorrect usage.");
return;
}
Sudoku sudoku;
Scanner scanNumber;
int[][] grid = new int[9][9];
File numbers = new File(args[0]);
try {
scanNumber = new Scanner(numbers);
while(scanNumber.hasNextInt()) {
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (scanNumber.hasNextInt()) {
grid[i][j] = scanNumber.nextInt();
}
}
}
sudoku = new Sudoku(grid);
int[][] solution = sudoku.solution();
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
System.out.print(solution[i][j] + " ");
}
System.out.println(" ");
}
System.out.println(" ");
}
}catch (FileNotFoundException e1) {
e1.printStackTrace();
}
}
}