-
Notifications
You must be signed in to change notification settings - Fork 0
/
strats.js
344 lines (299 loc) · 8.95 KB
/
strats.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
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
/*
contains functions that are startegies that you can use to solve sudokus
future todo:
- for all reduce the amount of cells that it highlights to all that you need
- add skyscapres and see what help that gives you
- just go through each grid and if there are any numbers with less than 3
options check if they are in the same row or col, and if they are elimate all of those numbers from that row or col -
myabe do this multiple times to get more, there can be like a 1 level skyscraper, then 2, maybe 3, after that probs not getting any more
- search for x and y wings
*/
// array of startegy functions that are generally in level of difficulty - easisest first
const strats = [
onlyOptionInGroup,
onlyOptionInRow,
onlyOptionInCol,
nakedSingle,
];
// getting help starts here - no pun intented
function helpfcn(board) {
// get possiblities board
let possiblities_board = [];
for (let i = 0; i < 9; i++) {
let row = [];
for (let j = 0; j < 9; j++) {
if (board[i][j] === "-1") {
let poss_arr = getPossibilities(i, j, board);
row.push(poss_arr);
} else {
row.push([]);
}
}
possiblities_board.push(row);
}
// go through strageies
for (s = 0; s < strats.length; s++) {
// call the stragey with the baord
let toR = strats[s](possiblities_board, board);
// if the given strategy worked
if (toR) {
// one option when it the only one in group, makes more sense to highlight all other in group
// check if it is the only option to make the highlight look better
let count = 0;
let toH = [];
// check square
const bigRow = Math.floor(toR[0][0] / 3);
const bigCol = Math.floor(toR[0][1] / 3);
for (let row = bigRow * 3; row < bigRow * 3 + 3; row++) {
for (let col = bigCol * 3; col < bigCol * 3 + 3; col++) {
if (possiblities_board[row][col].length === 0) {
count++;
toH.push([row, col]);
}
}
}
// return all
if (count === 8) {
return [toR[0], toR[1], toH];
}
// reset
count = 0;
toH = [];
// check row
for (let j = 0; j < 9; j++) {
if (possiblities_board[toR[0][0]][j].length === 0) {
count++;
toH.push([toR[0][0], j]);
}
}
if (count === 8) {
return [toR[0], toR[1], toH];
}
// reset
count = 0;
toH = [];
// check collumn
for (let i = 0; i < 9; i++) {
if (possiblities_board[i][toR[0][1]].length === 0) {
count++;
toH.push([i, toR[0][1]]);
}
}
if (count === 8) {
return [toR[0], toR[1], toH];
}
// wasn't only option - return normal
return toR;
}
}
// no strategy worked - no help can be given
return false;
}
// stratgegy you often start with - easiest - only one place a certain number can go in a 3x3 area
function onlyOptionInGroup(poss_board, board) {
// go through each area
for (let bigRow = 0; bigRow < 3; bigRow++) {
for (let bigCol = 0; bigCol < 3; bigCol++) {
// find how many options there are for each number
let options = [0, 0, 0, 0, 0, 0, 0, 0, 0];
// go through the area
for (let i = bigRow * 3; i < bigRow * 3 + 3; i++) {
for (let j = bigCol * 3; j < bigCol * 3 + 3; j++) {
// add the options
poss_board[i][j].forEach((poss) => options[poss - 1]++);
}
}
// go through options
for (let p = 0; p < options.length; p++) {
// if there is only one option for a number
if (options[p] === 1) {
// found!! - get the cells that help
let toH = onlyOptionInGroupHelper(p + 1, bigRow, bigCol, board);
// find it again
for (let ii = bigRow * 3; ii < bigRow * 3 + 3; ii++) {
for (let jj = bigCol * 3; jj < bigCol * 3 + 3; jj++) {
for (let g = 0; g < poss_board[ii][jj].length; g++) {
if (poss_board[ii][jj][g] === (p + 1).toString()) {
// return the one
return [[ii, jj], [(p + 1).toString()], toH];
}
}
}
}
}
}
}
}
// none found
return false;
}
// finds all cells that help show why it worked
function onlyOptionInGroupHelper(num, bigRow, bigCol, board) {
let idxs = [];
num = num.toString();
// go through all rows that colide with bigRow
for (let i = bigRow * 3; i < bigRow * 3 + 3; i++) {
// tad overkill
for (let j = 0; j < 9; j++) {
if (board[i][j] === num) {
idxs.push([i, j]);
}
}
}
// go through all colums that collide with bigCol
for (let j = bigCol * 3; j < bigCol * 3 + 3; j++) {
for (let i = 0; i < 9; i++) {
if (board[i][j] === num) {
idxs.push([i, j]);
}
}
}
return idxs;
}
// strategy - harder one - only one option for a number in a row
function onlyOptionInRow(poss_board, board) {
// go through every row and get options for each
for (let i = 0; i < 9; i++) {
let options = [0, 0, 0, 0, 0, 0, 0, 0, 0];
for (let j = 0; j < 9; j++) {
poss_board[i][j].forEach((p) => options[p - 1]++);
}
// go through options
for (let p = 0; p < options.length; p++) {
if (options[p] === 1) {
// found one!
let cell;
let num = (p + 1).toString();
// bring this back but better eventaully
// // make array of colums to search while finding the cell
// for(let jj = 0; jj < 9; jj++) {
// if(poss_board[i][jj].length !== 0) {
// toSearch.push(jj);
// poss_board[i][jj].forEach(poss => {
// if(poss === num) {
// cell = [i, jj];
// }
// });
// }
// }
let toSearch = [0, 1, 2, 3, 4, 5, 6, 7, 8];
for (let jj = 0; jj < 9; jj++) {
poss_board[i][jj].forEach((poss) => {
if (poss === num) {
cell = [i, jj];
}
});
}
// get the cells to higlights
let toH = onlyOptionInRowHelper(num, toSearch, board);
return [cell, [num], toH];
}
}
}
// didn't find any
return false;
}
// highligts functions
function onlyOptionInRowHelper(num, toSearch, board) {
toR = [];
// go through each column
toSearch.forEach((col) => {
for (let i = 0; i < 9; i++) {
if (board[i][col] === num) {
toR.push([i, col]);
}
}
});
return toR;
}
// same as only option in row but for columns
function onlyOptionInCol(poss_board, board) {
// go through every coloumn
for (let j = 0; j < 9; j++) {
let options = [0, 0, 0, 0, 0, 0, 0, 0, 0];
for (let i = 0; i < 9; i++) {
poss_board[i][j].forEach((p) => options[p - 1]++);
}
// go through options
for (let p = 0; p < options.length; p++) {
if (options[p] === 1) {
// found one
let cell;
let num = (p + 1).toString();
let toSearch = [0, 1, 2, 3, 4, 5, 6, 7, 8];
for (let ii = 0; ii < 9; ii++) {
poss_board[ii][j].forEach((poss) => {
if (poss === num) {
cell = [ii, j];
}
});
}
let toH = onlyOptionInColHelper(num, toSearch, board);
return [cell, [num], toH];
}
}
}
}
// highlighter
function onlyOptionInColHelper(num, toSearch, board) {
toR = [];
toSearch.forEach((row) => {
for (let j = 0; j < 9; j++) {
if (board[row][j] === num) {
toR.push([row, j]);
}
}
});
return toR;
}
// naked single strategy - need to look for - hardish - only one option a given cell can be
function nakedSingle(poss_board, board) {
for (let i = 0; i < 9; i++) {
for (let j = 0; j < 9; j++) {
if (poss_board[i][j].length === 1) {
let toH = nakedSingleHelper(i, j, board);
return [[i, j], [poss_board[i][j][0]], toH];
}
}
}
return false;
}
/**
* to get numbers to highlight, get possiblities has this, but returning it will mess up generator, so fuck it
*/
function nakedSingleHelper(i, j, board) {
// possible numbers
let poss = numbers.map((n) => n);
// indicies of taken away numbers
// [[i, j], ...]
let idxs = [];
// all numbers in grid
const bigRow = Math.floor(i / 3);
const bigCol = Math.floor(j / 3);
for (let row = bigRow * 3; row < bigRow * 3 + 3; row++) {
for (let col = bigCol * 3; col < bigCol * 3 + 3; col++) {
let toD = poss.indexOf(board[row][col]);
if (toD !== -1) {
poss.splice(toD, 1);
idxs.push([row, col]);
}
}
}
// get rid others in row
for (let y = 0; y < 9; y++) {
let toD = poss.indexOf(board[i][y]);
if (toD !== -1) {
poss.splice(toD, 1);
idxs.push([i, y]);
}
}
// all numbers in col
for (let x = 0; x < 9; x++) {
let toD = poss.indexOf(board[x][j]);
if (toD !== -1) {
poss.splice(toD, 1);
idxs.push([x, j]);
}
}
return idxs;
}