search

jonesnxt / kilordle

24 stars 20 forks source link

If all five letters in a word are guessed in correct place, but not at same time, the word is marked as solved. #11

Open TicoMonster opened 2 years ago

TicoMonster commented 2 years ago

Example: I guess 1) COUNT 2) SCORN 3) PACED, the words COURT and POUND and SOUND all get marked as having been guessed.

B000en commented 2 years ago

I actually really like this it makes the game playable

martinkozle commented 2 years ago

I thought this was intended?

AccurateFranky commented 2 years ago

its intended

dburt commented 2 years ago

Suggested extension: automate further hard deductions based on yellows as well. E.g. after guessing TIRED, TRIED will automatically be solved as well, because three greens and two yellows leaves only one possible solution, i.e. swap the yellows. This may support reduction of guesses (#13) to under 100.

TexasDex commented 2 years ago

If this is intended behavior, and each auto-finish doesn't count as a guess, then the 1005 guesses allowed is absurd overkill. I finished in 110 guesses.

It should also be better documented/explained to the user. At first I thought there were just a huge number of duplicate words in the dataset. Maybe we could clarify this by showing all the words that were completed on the side after each guess, with hovertext that explains how a single guess can complete multiple words.

martinkozle commented 2 years ago

It should also be better documented/explained to the user. At first I thought there were just a huge number of duplicate words in the dataset. Maybe we could clarify this by showing all the words that were completed on the side after each guess, with hovertext that explains how a single guess can complete multiple words.

I also thought at the beginning that there were duplicate words. I like your idea of showing the completed words from the last guess, it would be pretty cool.

omfR3 commented 2 years ago

Nice, using this knowledge I managed to beat it in 77 guesses. There's probably some optimal strategy of rotating the most common letters through their most frequent positions in the fewest guesses.