Sudoku-Solver/functionCollection.js at master · Anubis308/Sudoku-Solver · GitHub

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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
function getValues() {
    for (let i = 0; i < 81; i++) {
        //console.log(i%9,Math.floor(i/9));
        if (boardId[i].value) {
            borad[i % 9][Math.floor(i / 9)] = Number(boardId[i].value);
        }
        else {
            borad[i % 9][Math.floor(i / 9)] = 0;
        }

    }
}
function setValues() {
    for (let i = 0; i < 81; i++) {
        boardId[i].value = borad[i % 9][Math.floor(i / 9)];
    }
}

function clearButtonClick() {
    for (let i = 0; i < 81; i++) {
        boardId[i].value = "";
        borad[i % 9][Math.floor(i / 9)] = 0;
    }
}

function solveButtonClick() {
    getValues();

    //Checking before try to solve
    let preFlag = 0;
    for (let row = 0; row < N; row++) {
        let counter = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];

        for (let col = 0; col < N; col++) {
            if (borad[row][col] > 0) {
                counter[borad[row][col]]++;
            }

            if (counter[borad[row][col]] > 1) {
                //onsole.log(counter[borad[row][col]]);
                preFlag++;
            }
        }
    }
    for (let col = 0; col < N; col++) {
        let counter = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];

        for (let row = 0; row < N; row++) {
            if (borad[row][col] > 0) {
                counter[borad[row][col]]++;
            }
            if (counter[borad[row][col]] > 1) {
                //console.log(counter[borad[row][col]]);
                preFlag++;
            }
        }
    }
    for (let startRow = 0, startCol = 0, i = 0; i < N; i++) {
        let counter = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
        for (let row = 0; row < 3; row++) {
            for (let col = 0; col < 3; col++) {
                if (borad[row + startRow][col + startCol] > 0) {
                    counter[borad[row + startRow][col + startCol]]++;
                }
                if (counter[borad[row + startRow][col + startCol]] > 1) {
                    preFlag++;
                }
            }
        }
        startRow = (startRow + 3) % 9;
        if ((i + 1) % 3 == 0) {
            startCol = (startCol + 3) % 9;
        }
    }
    if (preFlag > 0) {
        alert("No solve");
    }
    else {
        SolveSudoku(borad) ? alert("Solved") : alert("No solve");
        setValues();
    }

}


function UsedInRow(grid, row, num) {
    for (let col = 0; col < N; col++)

        if (grid[row][col] === num) {

            return true;
        }
    return false;
}


function UsedInCol(grid, col, num) {
    for (let row = 0; row < N; row++)
        if (grid[row][col] == num)
            return true;
    return false;
}

function UsedInBox(grid, boxStartRow, boxStartCol, num) {
    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, row, col, num) {
    return !UsedInRow(grid, row, num) && !UsedInCol(grid, col, num) && !UsedInBox(grid, row - row % 3, col - col % 3, num) && grid[row][col] == UNASSIGNED;
}

function FindUnassignedLocation(grid, row, col) {
    for (row = 0; row < N; row++)
        for (col = 0; col < N; col++)
            if (grid[row][col] === UNASSIGNED)
                return true;
    return false;
}

function SolveSudoku(grid) {
    let row, col, flag = 0
    for (row = 0; row < N; row++) {
        for (col = 0; col < N; col++) {
            if (grid[row][col] === UNASSIGNED) {
                flag = 1;
                break;
            }
        }
        if (flag === 1)
            break;
    }
    if (flag === 0)
        return true;
    //console.log(row,col);
    // consider digits 1 to 9
    for (let num = 1; num <= 9; num++) {
        // if looks promising
        if (isSafe(grid, row, col, num)) {
            // make tentative assignment
            //console.log(row,col,num,grid);

            grid[row][col] = num;


            // return, if success, yay!
            if (SolveSudoku(grid))
                return true;

            // failure, unmake & try again
            grid[row][col] = UNASSIGNED;
        }
        else {
            //console.log("notsafe"+row,col);
        }
    }
    return false; // this triggers backtracking
}