> The goal is to maximize the amount of guesses it takes to find the word
The heuristic used is not optimal for this. You want to choose the set that takes the most number of guesses to split, which is not necessarily the set with the largest number of elements.
It's a cool idea, but it'd be nice to show which letters have been eliminated like "real" Wordle. I don't think not having them makes the game harder, just more tedious.
See also qntm's Absurdle, which similarly tries to be a maximally difficult by taking your guess at each stage and using it to prune the list of possible answers, picking the largest set consistent with your guesses so far each time.
This uses different word lists than Wordle/Adversarial Wordle, but still has a 4-guess optimum, no 3-guess is possible.
My solver's found about a thousand so far, here's a good one: "abyes choup donut dingo" (note that there are a number of 'fake' words allowed for guesses).
Ah yeah a friend sent that to me right after I created my version! I remembered making an “evil hangman” in class many years ago so probably a lot of folks will have the same idea.
I wonder what is the best strategy over a long distance?
“ALONE” and “SHIRT” cover 1st to 9th and 11th most common letters in English dictionary but then, you'll be getting more yellow letters in first two words which might not be the best approach (compared to completely eliminating 10 letters altogether).
Then, for words like “_OUCH”, it might be optimal to come up with a word containing as many potential first letters as possible (while omitting letters already in use, “ouch” in this case).
So, there's another evil Wordle thread on Hacker News today (https://news.ycombinator.com/item?id=29862597) and over there, I've been refining my algorith for optimal play. Here's the current approach:
R A I S E (0 green, 0 yellow, 168 words remain)
B L U D Y (1 green, 0 yellow, 13 words remain)
C O U N T (2 green, 1 yellow, 2 words remain)
V O U C H (4 green, 0 yellow, 1 word remains)
P O U C H (5 green, 0 yellow, 0 words remain)
But what was interesting was at one point of development, it did this:
L A R E S (0 green, 0 yellow, 576 words remain)
T O N I C (1 green, 0 yellow, 50 words remain)
B O O D Y (4 green, 0 yellow, 5 words remain)
D E G U M (0 green, 2 yellow, 1 word remains)
G O O D Y (5 green, 0 yellow, 0 words remain)
See, the "BOODY" has 4 greens, but then it went and guess "DEGUM" to eliminate a lot of possibilities!
Paste to debug in 12 guesses. Had never heard of the original wordle before, cool game.
wwwwY Paste
wwwww Color
wwwww Print
wwwww Loops
Ywwww Bombs
RRwww Death
RRRww Debts
RRRww Debby (It should be obvious here that I didn't know how the game worked)
RRRww Debit
wYwww Junks (Questionable that this is counted as a real word imo)
YwwwY Gorge
RRRRR Debug
This is fun! Though when I dove right in I mistakenly thought that the indicator for the correct letter was also indicating the correct position for that letter. But that was not the case. I had a weird combo and had to give up before I understood that.
My kid is now trying to solve it, keeping careful notes of letters. I explained what (I'm guessing) makes it evil, but she's undeterred. (Solved in 15)
22 guesses. Seems like the trick is to select letters in their worst positions first so that it later puts them in more favorable positions (e.g. don’t guess Q in the first spot if you can put it anywhere else first.
I keep pull down refreshing the page and can't go back to what the word was. Also cataegories would be nice. Also a list of the alphabet at the bottom would cross out wrong guesses would be nice.
[+] [-] pxx|4 years ago|reply
The heuristic used is not optimal for this. You want to choose the set that takes the most number of guesses to split, which is not necessarily the set with the largest number of elements.
[+] [-] sdwr|4 years ago|reply
[+] [-] bspammer|4 years ago|reply
[+] [-] raviparikh|4 years ago|reply
[+] [-] jtbayly|4 years ago|reply
[+] [-] moyix|4 years ago|reply
Play:
https://qntm.org/files/wordle/index.html
The author also wrote up this nice article describing in detail how the algorithm works:
https://qntm.org/wordle
Previous HN discussion: https://news.ycombinator.com/item?id=29862597
[+] [-] zwegner|4 years ago|reply
My solver's found about a thousand so far, here's a good one: "abyes choup donut dingo" (note that there are a number of 'fake' words allowed for guesses).
[+] [-] pxx|4 years ago|reply
abyes GXXXX
choup XXXXX
donut XXYXX
dingo XYYYX
matches both
aging, again
so this solution doesn't actually partition the solution space the way you want it to.
[+] [-] raviparikh|4 years ago|reply
I used a much larger dictionary for allowed guesses than for the actual words that get chosen.
[+] [-] ColinWright|4 years ago|reply
Same idea, different implementation.
[+] [-] raviparikh|4 years ago|reply
[+] [-] thaurelia|4 years ago|reply
“ALONE” and “SHIRT” cover 1st to 9th and 11th most common letters in English dictionary but then, you'll be getting more yellow letters in first two words which might not be the best approach (compared to completely eliminating 10 letters altogether).
Then, for words like “_OUCH”, it might be optimal to come up with a word containing as many potential first letters as possible (while omitting letters already in use, “ouch” in this case).
[+] [-] salomon812|4 years ago|reply
[+] [-] shawnz|4 years ago|reply
[+] [-] bejelentkezni|4 years ago|reply
[+] [-] strken|4 years ago|reply
[0] https://en.m.wikipedia.org/wiki/Junk_(ship)
[+] [-] cdubzzz|4 years ago|reply
[+] [-] ianbicking|4 years ago|reply
[+] [-] giarc|4 years ago|reply
[+] [-] krallja|4 years ago|reply
[+] [-] rkagerer|4 years ago|reply
[+] [-] unknown|4 years ago|reply
[deleted]
[+] [-] gowld|4 years ago|reply
No computer assistance, no obscure words, hard mode:
[+] [-] jimbob45|4 years ago|reply
[+] [-] unknown|4 years ago|reply
[deleted]
[+] [-] Physkal|4 years ago|reply
[+] [-] allannienhuis|4 years ago|reply
[+] [-] cableshaft|4 years ago|reply
STRAP - ______
BIOME - __Y_Y
HOVEL - _G_G_
CONED - GG_GY
CODEX - GGGG_
CODEC - GGGGG
Cool idea, btw.
[+] [-] turbonaut|4 years ago|reply
It only took 22 hours’ CPU time, a custom string encoding and several trillion operations to work out LARES was a decent first go.
[+] [-] raviparikh|4 years ago|reply
[+] [-] bmmayer1|4 years ago|reply
⬜⬜⬜⬜ ⬜⬜⬜⬜ ⬜⬜⬜⬜ ⬜⬜ ⬜⬜ ⬜ ⬜
https://swag.github.io/evil-wordle/
[+] [-] makach|4 years ago|reply
Ha! fun game. The fun was writing a program to narrow down the alternative words, now I lost interest in the game.
[+] [-] not2b|4 years ago|reply
[+] [-] zjs|4 years ago|reply
[+] [-] zdwolfe|4 years ago|reply