I crushed wordle within a few days of its popularity entering my sphere. It was pretty easy to brute-force a decision tree minimizing the average number of guesses using a lowly python script and a few days of qpu time.
Don't Wordle[1] is significantly more interesting; I've got a solver but the maximum score takes my lowly python script upwards of a day (per day) to solve using brute force. For now, I solve it with a heuristic that terminates in about 20 minutes. My old wordle solver was useful to find a good but suboptimal tree for identifying the answer in 5 undos or less.
Today:
Don't Wordle 1491 - SURVIVED
Hooray! I didn't Wordle today!
..... 8089
..... 4647
..... 2492
..... 1026
.Y... 231
..G.. 100
Undos used: 3
100 words remaining
x 10 unused letters
= 1000 total score
My puzzle ethics are: you can and should download the dictionaries of valid answers and valid guesses, you're allowed to keep them separate, but you must not keep the list of answers in its original order.I "crushed it" when it came out with Right click -> View source -> Find the list of words. All the future words were in the code already.
Another great variant is Unfair Wordle [1]. The opponent does not fix the answer upfront but instead evades the player's guesses as long as possible, providing you with the least information it legally can give (according to the usual rules) while still preserving a valid game completion path. The result is that your guesses end up looking extremely unlucky in retrospect.
[1] https://tweakimp.github.io/unfairwordle/