Using Python to play 100K Games of Wordle. Top Strategy Test!
Vložit
- čas přidán 26. 01. 2022
- You might be playing wrong and not knowing it. I'll show how we can create a test game and run simulated strategies on that program. Python playing Wordle will show you how to create a similar project on any game or simulation.
github.com/ClarityCoders/Wordle
You got something to say to me?? Join our discord!✌️
/ discord
the key point you are missing from your algorithm is that you know that a certain letter cannot exist in a certain position if it is yellow. that really helps filtering. for example, the algorighm should never suggest 'lurid' after 'girsh' because it already knew that the 'r' cannot be in the third letter position.
awesome video dude. got me motivated to actually start a new project haha
Great video!
YES i would love to see an ai handling this, maybe can figure it out on the second attempt if it was lucky?
Such a sick video! Would love to see what an ML model could do!! It'd be interesting to see if it comes up with any new strategies on it's own!
Great video
I checked the strat 2 and I don't see a filter for yellow letters that blocks words that have the correct letter but on the yellow's spot, which is already known to be the wrong location.
love it, keep them coming! ai would be great…
so stretegy1 is basically one exploration round and strategy2 is 3 exploration rounds. you should test 2 and 4 rounds as well to find the real sweet spot
Maybe keep stats on what exploration words have the best hit rate and use those first, also could find a relationship between possible words remaining, guesses remaining, and known/perfect letters to calculate when to switch from exploration phase to guessing phase.
do it! Also, do you know Hanabi?
Yes!
Quite funny, I use the 2 totally different words for the first two choices to cut down on my options and start trying to guess from the third onwards with the information I got.
Great video.
The game's pretty similar to Mastermind(or Bulls and Cows), so I would look for inspiration there, since there are already algorithms that solve that problem under 6 moves in the worst case scenario. I suppose that it's harder when choices must include valid words and not only a combination of colors :)
using AI to make the perfect algo would be really cool!
Been down a rabbit hole with the nltk word list to see if the letter_frequencies agreed, and then if the letter_frequencies for the 5 letter words were any different.
There's another bit of knowledge you get while playing that didn't get factored in. I'm curious how it affects the two strategies: when you get a yellow letter, you know that it can never be correct in that position otherwise it would have been green. For example, @
Machine Learning please!
wouldn't an optimal guess just be a set of letters which eliminated the most words? Repeat until only one word left