Return to Revisions

Clutch Wordle Solver with known inputs

Sometimes when you're playing Wordle, you get to your fifth guess and you can't figure out the word any more, so you start mentally running through the list of remaining iterations, both sensical and nonsensical trying to figure out what those last few letters are.

The task here is to create all permutations of a final Wordle guess to save me from having to do it in my head, with the following rules:

General rules:

• Wordle rules apply. All guesses must be exactly 5 letters
• Since Wordle only uses valid English words, only letters that appear on a standard English keyboard (a-z) need to be tested.
• Solution is case insensitive.

Input:

• A list of letters and indices (0 or 1 indexed, your choice), indicating the location of confirmed/green letters;
• A list of letters and indices (consistently indexed), indicated yellow letters (i.e. the index is a known location the letter is not;
• A list/string of letters that are yet to be guessed.

Note, green and yellow may still appear in more than the known positions.

Output:

All potential "words" of exactly 5 letters, such that the green letters are in the indicated indexes, the yellow letters are not in the indicated indexes, and the words consist of only the green, yellow, and remaining letters. The output may be in any order

To confirm the list, in each case you can multiply the possible letters for each slot by the number of possible letters in all of the other slots (slot 1 * slot 2 * slot 3 * slot 4 * slot 5).

What's the shortest way to solve this problem? You may take input and output in any convenient method or format.

Example:

1. Green Guesses (1 indexed): O=2, E=4, N=5
2. Yellow Guesses: N!=3 (E!=5 is excluded because we know N=5)
3. Unguessed Letters: Q, W, I, P, F, J, K, X, B

Output would be a list of all possible permutations given the known information, such as:

In this case, there are 12, 1, 11, 1, 1 potential outcomes for each slot, so the list should have 12*11 items or 132.