forked from loiane/javascript-datastructures-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsudoku-solver.ts
87 lines (75 loc) · 1.76 KB
/
sudoku-solver.ts
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
const UNASSIGNED = 0;
export function sudokuSolver(grid: Array<Array<number>>) {
if (solveSudoku(grid) === true) {
return grid;
} else {
return 'NO SOLUTION EXISTS!';
}
}
function solveSudoku(grid: Array<Array<number>>) {
let row = 0;
let col = 0;
let checkBlankSpaces = false;
for (row = 0; row < grid.length; row++) {
for (col = 0; col < grid[row].length; col++) {
if (grid[row][col] === UNASSIGNED) {
checkBlankSpaces = true;
break;
}
}
if (checkBlankSpaces === true) {
break;
}
}
if (checkBlankSpaces === false) {
return true;
}
for (let num = 1; num <= 9; num++) {
if (isSafe(grid, row, col, num)) {
grid[row][col] = num;
if (solveSudoku(grid)) {
return true;
}
grid[row][col] = UNASSIGNED;
}
}
return false;
}
function usedInRow(grid: Array<Array<number>>, row: number, num: number) {
for (let col = 0; col < grid.length; col++) {
if (grid[row][col] === num) {
return true;
}
}
return false;
}
function usedInCol(grid: Array<Array<number>>, col: number, num: number) {
for (let row = 0; row < grid.length; row++) {
if (grid[row][col] === num) {
return true;
}
}
return false;
}
function usedInBox(
grid: Array<Array<number>>,
boxStartRow: number,
boxStartCol: number,
num: number
) {
for (let row = 0; row < 3; row++) {
for (let col = 0; col < 3; col++) {
if (grid[row + boxStartRow][col + boxStartCol] === num) {
return true;
}
}
}
return false;
}
function isSafe(grid: Array<Array<number>>, row: number, col: number, num: number) {
return (
!usedInRow(grid, row, num) &&
!usedInCol(grid, col, num) &&
!usedInBox(grid, row - row % 3, col - col % 3, num)
);
}