-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtusmo.js
286 lines (258 loc) · 8.17 KB
/
tusmo.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
const TYPE_SPEED = 20;
let realDico = [];
let dico = [];
let lastIndex = -1;
let lastWord = null;
let blackListedWords = [];
window.solverEnabled = false;
chrome.storage.sync.get(
["blackListedWords", "enabled"],
function ({ blackListedWords, enabled }) {
solverEnabled = enabled;
blackListedWords = blackListedWords ? JSON.parse(blackListedWords) : [];
console.debug("Blacklisted words", blackListedWords.sort());
blackListedWords.forEach(removeFromDicos);
}
);
// Fetch dictionary
fetch(chrome.runtime.getURL("dico.txt")).then(async (res) => {
realDico = (await res.text()).split(" ");
});
// Add custom css
var link = document.createElement("link");
link.href = chrome.runtime.getURL("override.css");
link.type = "text/css";
link.rel = "stylesheet";
document.getElementsByTagName("head")[0].appendChild(link);
const STATE = {
GUESSING: "bg-sky-600",
INCORRECT: "y",
FOUND: "r",
IMPOSSIBLE: "-",
};
function removeFromDicos(word) {
realDico = realDico.filter((w) => w !== word);
dico = dico.filter((w) => w !== word);
}
function getNumTimesLetterInWord(word, letter) {
return (word.match(new RegExp(letter, "g")) || []).length;
}
function getWordWeight(word) {
return Array.from(word).reduce((r, c, i) => {
const nbTimesUsed = getNumTimesLetterInWord(word.substr(0, i + 1), c);
return r + 1 / Math.pow(2, nbTimesUsed);
}, 0);
}
function getBestWord(list) {
const best = list.reduce(
(res, current) => {
const score = getWordWeight(current);
if (res.score < score) {
res.score = score;
res.word = current;
}
return res;
},
{
word: "",
score: 0,
}
);
return best;
}
function getCellState(cell) {
for (let state in STATE) {
if (cell.classList.contains(STATE[state])) {
return state;
}
}
// console.log('not found', cell.innerText)
}
function getCellLetter(cell) {
return cell.innerText.toLowerCase();
}
function getHistory(cells, wordLen) {
const result = [];
for (let i = 0; i < cells.length; i += wordLen) {
const wordCells = cells.slice(i, i + wordLen);
const word = wordCells.map((c, index) => ({
position: index,
letter: getCellLetter(c),
placement: getCellState(c),
}));
word.word = wordCells.map((c) => getCellLetter(c)).join("");
result.push(word);
}
return result;
}
function fillFilter(letterFilter, line, letter, wordLen) {
const nbPossible = line.filter(
(cell) => cell.letter === letter && cell.placement !== "IMPOSSIBLE"
);
const nbImpossible = line.filter(
(cell) => cell.letter === letter && cell.placement === "IMPOSSIBLE"
);
const min = nbPossible.length;
const max = nbImpossible.length > 0 ? min : wordLen;
if (max === 0) {
return;
}
if (!letterFilter[[letter]]) {
letterFilter[[letter]] = { min: min, max: max };
} else {
if (min > letterFilter[[letter]].min) {
letterFilter[[letter]].min = min;
}
if (max < letterFilter[[letter]].max) {
letterFilter[[letter]].max = max;
}
}
}
function getReg(history, wordLen) {
const myRegx = Array(wordLen).fill("[abcdefghijklnmopqrstuvwxyz]");
let impossibleLetters = "";
let letterFilter = {};
for (let x = 0; x < wordLen; ++x) {
for (let y = 0; y < history.length; ++y) {
const state = history[y][x].placement;
const letter = history[y][x].letter;
if (state === undefined) {
continue;
}
if (state === "FOUND") {
myRegx[x] = letter;
} else if (state === "INCORRECT") {
myRegx[x] = myRegx[x].replace(letter, "");
} else if (state === "IMPOSSIBLE") {
const hasIncorrectLetters =
history[y].filter(
(cell) =>
cell.letter === letter &&
cell.placement === "INCORRECT"
).length > 0;
if (hasIncorrectLetters) {
continue;
}
if (!impossibleLetters.includes(letter)) {
impossibleLetters += letter;
}
for (let tmpX = 0; tmpX < wordLen; ++tmpX) {
if (myRegx[tmpX].includes("[")) {
myRegx[tmpX] = myRegx[tmpX].replace(letter, "");
}
}
}
fillFilter(letterFilter, history[y], letter, wordLen);
}
}
// console.debug({ finalRegex, impossibleLetters, letterFilter });
return { reg: myRegx.join(""), letterFilter };
}
function checkIfLetterIsPresent(string, substring) {
var letters = [...string];
return substring.split("").every((x) => {
var index = letters.indexOf(x);
if (~index) {
letters.splice(index, 1);
return true;
}
});
}
function checkLetterNbPresence(word, letterFilter) {
for (let letter of Object.keys(letterFilter)) {
const nbLetterPresence = getNumTimesLetterInWord(word, letter);
if (
nbLetterPresence < letterFilter[[letter]].min ||
nbLetterPresence > letterFilter[[letter]].max
) {
return false;
}
}
return true;
}
function pressKey(keyCode) {
window.dispatchEvent(new KeyboardEvent("keypress", { keyCode }));
window.dispatchEvent(new KeyboardEvent("keyup", { keyCode }));
}
function blackListWord(word) {
if (!blackListedWords.includes(word)) {
blackListedWords.push(word);
removeFromDicos(word);
}
chrome.storage.sync.set(
{ blackListedWords: JSON.stringify(blackListedWords) },
function () {
console.debug(`'${word}' added to blacklist`);
}
);
}
function guessWord(word) {
let timeout = 0;
if (!word) {
return console.debug("word empty");
}
Array.from(word.toUpperCase()).forEach((c) => {
const keyCode = c.charCodeAt(0);
setTimeout(() => pressKey(keyCode), (timeout += TYPE_SPEED));
});
setTimeout(() => pressKey(13), (timeout += TYPE_SPEED));
}
function run() {
if (!solverEnabled) {
return;
}
const gameColumn = document.getElementsByClassName("game-column")[0];
if (!gameColumn) {
return;
}
const cells = [...gameColumn.getElementsByClassName("cell-content")];
if (!cells.length) {
return;
}
const wordLen = cells.length / 6;
const currentLineStartIndex = cells.findIndex((c) =>
c.classList.contains(STATE.GUESSING)
);
if (lastIndex === currentLineStartIndex) {
if (lastWord && currentLineStartIndex !== -1) {
blackListWord(lastWord);
} else {
return;
}
}
lastIndex = currentLineStartIndex;
if (currentLineStartIndex === -1) {
return;
}
if (currentLineStartIndex === 0) {
dico = [];
// console.debug("new round");
}
const currentGuessCells = cells.slice(
currentLineStartIndex,
currentLineStartIndex + wordLen
);
const currentWord = currentGuessCells.map(getCellLetter).join("");
let word = "";
if (dico.length === 0) {
dico = realDico.filter(
(w) => w.length === wordLen && w[0] === currentWord[0]
);
}
const history = getHistory(cells, wordLen);
const { reg, letterFilter } = getReg(history, wordLen);
console.debug({ reg, letterFilter });
// const reg = getReg(history, wordLen, impossibleLetters);
const regEx = new RegExp(reg);
let possibleWords = dico
.filter((w) => !!w.match(regEx))
.filter((w) => checkLetterNbPresence(w, letterFilter));
// .filter((w) => checkIfLetterIsPresent(w, reg.incorrectWords));
console.debug(possibleWords);
const best = getBestWord(possibleWords);
word = best.word;
console.log(`best word: '${best.word}' with score ${best.score}`);
lastWord = word;
guessWord(word);
}
console.log(setInterval(run, 1500));