---

A Wordle solver implemented in Python 🐍

_{Why did I decide to ruin the fun of the game? For fun of course (and to see if I could 😋)}

How does it work? 🤔

This implementation is pretty intuitive, no fancy graph or greedy algorithms were required to determine the most likely word, thanks to dynamic programming (through the use of a cached wordlist).

The code begins by suggesting a word containing the most mathematically likely word with completely unique (non-repeating) characters, RAISE, to greatly narrow the list of possibilities from thousands of words to tens of words! . In the second iteration, the code creates a list of words from the original (unaltered) wordlist using the following rules:

The word contains none of the characters in the first guess

The word contains purely unique characters

This allows us to try out a total of 10 unique characters in the first two tries, so that we can narrow down the cached wordlist as much as possible. In future tries, the code suggests a random word from the cached wordlist each iteration, after which the wordlist is updated to get rid of unlikely words.

The elimination of words in every iteration is performed using a scoring mechanism. The scores are as follows:

Each word in the cached wordlist is scored against the guess and is not removed if and only if it satisfies all of the following:

It does not contain any absent characters

It contains the correct characters in the right positions

It contains the present characters in a different position

All words that do not fit this criteria are removed from the cached wordlist. This narrows down the list of possibilities each iteration and, on average, solves the wordle in 3-ish tries!

Example Run 🎮

$ ./wordler.py

┌───────────────────────────────────────────────────────────────────────┐
│                           Welcome to Wordler!                         │
└───────────────────────────────────────────────────────────────────────┘

> I see 2316 possibilities...
│ Start by giving 'RAISE' a try...

Enter a custom guess or score for suggested word (or "h" for help): 00210

> I see 29 possibilities...
│ Now, give 'THONG' a go...

Enter a custom guess or score for suggested word (or "h" for help): 00000

> I see 9 possibilities...
│ Try guessing 'SPILL'...

Enter a custom guess or score for suggested word (or "h" for help): 22222

│ You did it!

┌───────────────────────────────────────────────────────────────────────┐
│                      Thank you for using Wordler!                     │
└───────────────────────────────────────────────────────────────────────┘

_{Correct on the 3rd try? Pretty good! 🤑}

Requirements ⚒️

You need python3 and the following packages:

enum, random, collections

Note: You can install a package by running pip3 install [package-name]

Usage 🕹️

Clone this repo by running: git clone https://github.com/black-tul1p/wordler.git

Run the program after cd-ing into the cloned directory by running: ./wordler.py or python3 wordler.py

Next Steps ✏️

There are a few approaches I can think of when trying to make this program more accurate. These involve recommending words based on :

1. highest number of distinct constituent alphabets from the wordlist
2. frequency of occurrence of constituent alphabets in the English language
3. combining 1 and 2 and picking words with distinct constituent alphabets in the English language
4. frequency of occurence of entire (5-letter) words in the English language
5. some combination of 4 and one of the prior options for fine-tuning

(Intuition tells me that approaches 4 and 5 will provide the best results.)

---

Note: This program uses the wordlist from csokolove/wordle-word-list.

Thanks to Tyler Glaiel for figuring out the most mathematically likely word with non-repeating characters.