71–80 of 159 posts
Do any bots incorporate the history of wordle words? Wordle never repeats previous words so I wonder if the “best Xth word to guess” could change at some point?
For example this Saturday's word will be panic.
I modeled my Wordle solver[1] after Donald Knuth's Mastermind strategy[2]. An optimal guess is found by looking at the list of possible solutions and for each of those possible solutions checking how much each possible guess would narrow down the list of possible solutions. Once you have a list of all possible guesses and how much each of those possible guesses would narrow down the total number of possible solutions…
For today's word (abbey):
- input "arise" (match "a", wrong position "e")
- solver says there are 10 possible words, one of them is "apnea"
- input "apnea" (match "a", match "e") EDIT: fixed
- solver says there are 0 possible words (it assumes last "a" should appear yellow, but the wordle page has the last "a" as grey because there is only one "a" in the word)
A friend wrote up a post a couple of weeks ago about solving Wordle with python: https://poetix.medium.com/playing-wordle-with-python-6750185... I note that a very recent Wordle game used the same letter twice, rudely negating one of his otherwise quite reasonable assumptions there.
I modeled my Wordle solver[1] after Donald Knuth's Mastermind strategy[2]. An optimal guess is found by looking at the list of possible solutions and for each of those possible solutions checking how much each possible guess would narrow down the list of possible solutions. Once you have a list of all possible guesses and how much each of those possible guesses would narrow down the total number of possible solutions…
This does not quite work. For today's word (abbey): - input "arise" (match "a", wrong position "e") - solver says there are 10 possible words, one of them is "apnea" - input "apnea" (match "a", match "e") EDIT: fixed - solver says there are 0 possible words (it assumes last "a" should appear yellow, but the wordle page has the last "a" as grey because there is only one "a" in the word)
I modeled my Wordle solver[1] after Donald Knuth's Mastermind strategy[2]. An optimal guess is found by looking at the list of possible solutions and for each of those possible solutions checking how much each possible guess would narrow down the list of possible solutions. Once you have a list of all possible guesses and how much each of those possible guesses would narrow down the total number of possible solutions…
This does not quite work. For today's word (abbey): - input "arise" (match "a", wrong position "e") - solver says there are 10 possible words, one of them is "apnea" - input "apnea" (match "a", match "e") EDIT: fixed - solver says there are 0 possible words (it assumes last "a" should appear yellow, but the wordle page has the last "a" as grey because there is only one "a" in the word)
I modeled my Wordle solver[1] after Donald Knuth's Mastermind strategy[2]. An optimal guess is found by looking at the list of possible solutions and for each of those possible solutions checking how much each possible guess would narrow down the list of possible solutions. Once you have a list of all possible guesses and how much each of those possible guesses would narrow down the total number of possible solutions…
For instance, "waxed" is not suggested even though it is a legitimate word
This strategy seems to avoid words that Wordle will accept, while not choosing them as word-of-the-day, e.g. SERAI. If your goal is to minimize the number of remaining words in the worst case, I think SERAI is the winner, leaving you with at most 697 choices. [Assuming my code is right]
Genuinely curious, why would you use SERAI rather than ARISE? Functionally equivalent, doesn't seem like a made-up word, and might actually be the answer one day.
What's the opposite - a "bongcloud" for Wordle?
Earlier quoted context omitted.
> It seems clear to me that there is an optimal starting word I took one step further and calculated the optimal starting word for obtaining green matches (I assume that this also makes it likely to produce yellow matches, although I did not explicitly optimize for that). Beginning with the full list of 5-letter words, I calculated the frequency of each letter of the alphabet in each of the 5 possible positions for a…
Interesting. I've been using ORATE as it knocks out a lot of the top frequency letters from the english language as a whole. But I guess the distribution in five letter words, and more so in a subset of five letter words, may skew differently.