Show HN: Evil Wordle
swag.github.io
swag.github.io
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.
Play:
https://qntm.org/files/wordle/index.html
The author also wrote up this nice article describing in detail how the algorithm works:
Previous HN discussion: https://news.ycombinator.com/item?id=29862597
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).
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.
My solution is static and doesn't take any clues into account, so what you're saying just doesn't feel very relevant. The only "solution in general" to an arbitrary adversary, if you're not allowed to look at the clues it gives, is just to guess every single target word, which isn't very interesting.
Now, you could easily argue that the greedy strategy used by the site is suboptimal, and I'd agree, but AFAIK nobody's put up a site with a better one yet.
choup xxyxx
donut gygxx
dingo ggggg
:D
I used a much larger dictionary for allowed guesses than for the actual words that get chosen.
Same idea, different implementation.
“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).
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! 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 DebugNo computer assistance, no obscure words, hard mode:
AIRED -----
BOOTS -----
PLUNK --U-K
CHUCK CHUCKSTRAP - ______
BIOME - __Y_Y
HOVEL - _G_G_
CONED - GG_GY
CODEX - GGGG_
CODEC - GGGGG
Cool idea, btw.
1. LARES - xxxxx
2. BIONT - xxYxx
3. PUDGY - xxxxG
4. COMFY - GGxxG
5. COCKY - GGGGG
I agree - great idea.It only took 22 hours’ CPU time, a custom string encoding and several trillion operations to work out LARES was a decent first go.
STRAY - xxxxx
BOWEL - xxxYx
MEDIC - xYxYY
CHUNK - GGxGx
CHINE - GGGGG
I guess that means that 4 isn't possible? Is there a better strategy for the opponent that would make even 5 impossible?ADIEU BLAST MANOR FANNY CANNA
⬜⬜⬜⬜ ⬜⬜⬜⬜ ⬜⬜⬜ ⬜⬜
The best I had gotten myself was five.
⬜⬜⬜⬜ ⬜⬜⬜⬜ ⬜⬜⬜⬜ ⬜⬜ ⬜⬜ ⬜ ⬜
Ha! fun game. The fun was writing a program to narrow down the alternative words, now I lost interest in the game.
Y____
YY___
_____
_G_GG
GG_GG
GGGGGTurns out _o_es has a few options to guess...
toast
cluEd
whEre
BEGIN
BEING Correct!
arose until weeds peeks seems beefs
Evil Wordle: "booed". I won after 9 guesses
⬜⬜⬜⬜ ⬜⬜⬜⬜ ⬜⬜⬜ ⬜⬜ ⬜⬜ ⬜ ⬜ ⬜
Not really fun when the dictionary uses extremely obscure words.
There you go.
> Use “bfekpv” in a sentence.
You're a monster.
You've heard of Dire Straits, right?