forked from flash6083/HacktoberFest-GUI-Projects-and-Games
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolver.js
290 lines (233 loc) · 8.82 KB
/
solver.js
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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
class Solver {
watch = true;
speed = 200;
requestStop = false;
board;
originalBoard;
boardSize;
boxSize;
boardRows;
boardColumns;
boardBoxes;
questionsCount;
solvedCount=0;
isBoardSolved = false;
emptiesObject = {};
singlesObject = {};
backTrackObject = {};
constructor(_board) {
this.board = _board;
this.originalBoard = copyBoard(_board);
this.boardSize = _board.length;
this.boxSize = parseInt(Math.sqrt(this.boardSize))
this.init3arrays()
this.questionsCount = this.findQuestionsCount();
this.solvedCount = 0;
}
startSolving(){
this.initEmptiesObject()
this.singlesFinder()
if(!this.isBoardSolved) this.backTracking()
}
initEmptiesObject() {
let emptyObjectCounter = 0;
for (let row = 0; row < boardSize; row++) {
for (let col = 0; col < boardSize; col++) {
if (this.board[row][col] == 0) {
let boxNumber = getBoxNumber(row, col, this.boxSize);
this.emptiesObject[`${emptyObjectCounter}`] = {
row: row,
col: col,
box: boxNumber,
currentValue: 0,
possibleValues: [],
possibleIdx: null,
isSingle: false,
solved: false
}
emptyObjectCounter++;
}
}
}
if (emptyObjectCounter != this.questionsCount) {
console.log("Error in intEmptiesObject: questionsCount and empty object count doesn't match");
}
}
//################################ Singles Finder START
// the below function is not being used and is replaced by singlesFinder
createSinglesObject() {
let singlesCounter = 0;
for (let idx = 0; idx < Object.keys(this.emptiesObject).length; idx++) {
let obj = this.emptiesObject[idx];
let isSingleFilled = this.findSinglesFromObject(obj);
if (isSingleFilled > 0) {
this.singlesObject[singlesCounter] = obj;
singlesCounter++
}
}
// write values to board
if (singlesCounter > 0) {
this.solvedCount = singlesCounter;
this.writeToBoard(this.singlesObject)
view.printBoard(this.board)
}
// is board solved
if (this.solvedCount == this.questionsCount) {
this.isBoardSolved = true;
console.log("Board Solved: createSinglesObject attempt 1");
}else{
this.singlesFinder()
}
}
singlesFinder() {
let valuesFilledCounter;
do {
valuesFilledCounter = 0;
for (let idx in this.emptiesObject) {
let obj = this.emptiesObject[idx]
if (!obj.solved) {
let isSingleFilled = this.findSinglesFromObject(obj);
if (isSingleFilled > 0) {
this.singlesObject[valuesFilledCounter] = obj;
valuesFilledCounter++;
}
}
}
// write values to board
if (valuesFilledCounter > 0) {
this.solvedCount += valuesFilledCounter;
this.writeToBoard(this.singlesObject)
view.printBoard(this.board)
}
} while (valuesFilledCounter > 0);
// is board solved
if (this.solvedCount == this.questionsCount) {
this.isBoardSolved = true;
console.log("Singles: board solved");
//validate the board
let isSolutionValid = this.boardValidation()
if(isSolutionValid) console.log('Singles: solution is a valid sudoku');
alert('Yo!!! Board Solved')
}
console.log(`Singles: ${this.solvedCount} filled out of ${this.questionsCount}`);
}
findSinglesFromObject(obj) {
let valueFilled = 0;
let { row, col, box } = obj;
let isSingle = this.checkIfSingle(row, col, box);
if (isSingle.length == 1) {
valueFilled = isSingle[0];
obj.isSingle = true;
obj.solved = true;
obj.currentValue = isSingle[0];
}
obj.possibleValues = [...isSingle];
obj.possibleIdx = 0;
return valueFilled;
}
checkIfSingle(row, col, box) {
let possible = Array.from({ length: boardSize }, (val, idx) => idx + 1)
let rowValues = [...new Set(this.boardRows[row])]
let colValues = [...new Set(this.boardColumns[col])]
let boxValues = [...new Set(this.boardBoxes[box])]
let existigValues = [...new Set(rowValues.concat(colValues).concat(boxValues))]
removeInArrayValue(existigValues, 0);
for (let item of existigValues) removeInArrayValue(possible, item);
return possible;
}
//################################ Singles Finder END
//################################ back tracking START
async backTracking(){
let bTquestions = this.createBackTrackingObject()
console.log(`backTrackign: remaining empty items are: ${bTquestions}`);
let beforeBackTrackBoard = copyBoard(this.board);
let i = 0;
let iterations = 0;
while(i < bTquestions){
let obj = this.backTrackObject[i]
let {row, col, box, possibleValues, possibleIdx} = obj;
let isFilled = false;
while(possibleIdx < possibleValues.length){
let value = possibleValues[possibleIdx]
let isValueValid = this.checkIfValidValue(row, col, box, value)
possibleIdx++;
this.backTrackObject[i].possibleIdx = possibleIdx;
if(isValueValid){
this.backTrackObject[i].currentValue = value
isFilled = true
break;
}
}
//if no value filled for this 'i'
if(!isFilled){
if(i == 0 ){
console.log('backTracking: solution cannot be found');
return;
}else{
this.backTrackObject[i].possibleIdx = 0;
this.backTrackObject[i].currentValue = 0;
i -= 2;
}
}
this.writeToBoard(this.backTrackObject)
view.printBoard(this.board)
//if user requests to stop then abort
if(this.requestStop) return;
// all things related to speeed and watch
if(this.watch){
let reduction = parseInt(iterations/100)*10
reduction = reduction >= this.speed ? 0 : reduction;
await sleep(this.speed - reduction )
}
i++; iterations++;
}
// final steps
console.log('iteration done: ', iterations);
if(this.boardValidation()){
console.log('backTracking Complete: board Solved');
alert('Yo!!! Board Solved')
}else{
console.log('backTracking Complete: no solution found');
}
}
checkIfValidValue(row,col,box,value){
let isValid = true;
let rowValues = [...new Set(this.boardRows[row])]
let colValues = [...new Set(this.boardColumns[col])]
let boxValues = [...new Set(this.boardBoxes[box])]
if(rowValues.includes(value) || colValues.includes(value) || boxValues.includes(value)) isValid = false;
return isValid;
}
createBackTrackingObject(){
let counter = 0;
for(let idx in this.emptiesObject){
let obj = this.emptiesObject[idx];
if(!obj.solved){
this.backTrackObject[counter] = obj;
counter++;
}
}
return counter;
}
//################################ back tracking END
writeToBoard(_obj) {
let objLen = Object.keys(_obj).length;
for (let i = 0; i < objLen; i++) {
let obj = _obj[i];
this.board[obj.row][obj.col] = obj.currentValue;
}
this.init3arrays()
}
init3arrays() {
this.boardRows = this.board;
this.boardColumns = generateColumnArray(this.board)
this.boardBoxes = generateBoxArray(this.board, this.boardSize)
}
findQuestionsCount() {
return parseInt(Math.pow(this.boardSize, 2)) - this.board.reduce((a, b) => a + (b.filter(x => x > 0).length), 0)
}
boardValidation(){
let resultValidator = new Validate(this.board,this.boardSize);
return resultValidator.runTests()
}
}