-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
refactor game logic into a new class
- Loading branch information
1 parent
80415dc
commit 8d3cf17
Showing
2 changed files
with
89 additions
and
74 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,87 @@ | ||
| import { arrayRemoveValue, arrayIntersection, arrayCount } from "./util"; | ||
| import { RateWordCriteria } from "./word-list"; | ||
|
|
||
|
|
||
| /** | ||
| * After user makes a guess and Wordle responds, updates the criteria object with any new info. This will | ||
| * allow future guesses to be narrowed down. | ||
| * | ||
| * @param guess What user guessed. | ||
| * @param result What Wordle responed with (five-letter string of letters G=green, Y=yellow, B=black) | ||
| * @param criteria Current criteria. This object will be updated based on the response. | ||
| */ | ||
| export const updateCriteriaPerResult = (guess: string, result: string, criteria:Required<RateWordCriteria>):void => { | ||
| // required letters are kind of tricky. say the correct answer is "truss", and we guessed "shore". | ||
| // => requiredLetters has an S. | ||
| // Now, say we guess "shops". We need to know now that required letters has two Ss. | ||
| // Now, say we guess "sassy". We need to make sure that we don't end up with three Ss in required letters | ||
| const requiredLettersCopy = [...criteria.requiredLetters]; | ||
|
|
||
| const blackLetters:string[] = []; | ||
| const nonBlackLetters:string[] = []; | ||
|
|
||
| for(let i = 0; i < 5; i++) { | ||
| const guessLetter = guess[i]; | ||
| const resultColor = result[i]; | ||
| if(resultColor === 'g') { | ||
| // green - this is a correct letter! | ||
| criteria.correctLetters[i] = guessLetter; | ||
| } | ||
| else if(resultColor === 'y') { | ||
| // yellow - this letter is in the word, but not at this position | ||
| criteria.invalidLettersByPosition[i].add(guessLetter); | ||
| } | ||
| else if(resultColor === 'b') { | ||
| // black/gray - this letter is not in the word at all | ||
| criteria.invalidLetters.add(guessLetter); | ||
| criteria.invalidLettersByPosition[i].add(guessLetter); | ||
| } | ||
| else { | ||
| throw new Error(`Invalid color: ${resultColor}`) | ||
| } | ||
|
|
||
| if(resultColor === 'g' || resultColor === 'y') { | ||
| nonBlackLetters.push(guessLetter); | ||
| if(requiredLettersCopy.includes(guessLetter)) { | ||
| // this letter was already in criteria.required letters. Remove it from the copy, so that if | ||
| // there is another yellow/green of this letter, it doesn't get skipped. | ||
| arrayRemoveValue(requiredLettersCopy, guessLetter); | ||
| } | ||
| else { | ||
| // this yellow/green letter wasn't already in required letters, so add it. | ||
| criteria.requiredLetters.push(guessLetter); | ||
| } | ||
| } | ||
| else { | ||
| blackLetters.push(guessLetter); | ||
| } | ||
| } | ||
|
|
||
| // in the case where we guessed a word that has two instances of a letter, but only one is correct, | ||
| // we will have the letter in invalidLetters but also in correctLetters or requiredLetters, which | ||
| // results in an impossible solution. So we have to remove that letter from invalidLetters | ||
| for(const letter of criteria.correctLetters) { | ||
| if(letter) | ||
| criteria.invalidLetters.delete(letter); | ||
| } | ||
| for(const letter of criteria.requiredLetters) { | ||
| if(letter) | ||
| criteria.invalidLetters.delete(letter); | ||
| } | ||
|
|
||
| // If word is "myths" and we guess "truss" (ybbbg) or "tessa" (ybybb), | ||
| // we would know from one S being black and one S being non-black that | ||
| // there is exactly one S in the solution. So for any letter that appears | ||
| // in both black and nonblack colors, the exact number of that letter in | ||
| // the correct answer is the number of times that letter appears as | ||
| // non-black. | ||
| const multicolorLetters:string[] = arrayIntersection(blackLetters, nonBlackLetters); | ||
| for(const letter of multicolorLetters) { | ||
| criteria.knownLetterCounts[letter] = arrayCount(nonBlackLetters, letter); | ||
| } | ||
|
|
||
| //console.log(); | ||
| //console.log('current criteria:') | ||
| //console.log(JsonStringifySets(criteria)); | ||
| //console.log(); | ||
| } |