# Optimal Wordle

This week’s Riddler Classic is about the viral word game Wordle.

Find a strategy that maximizes your probability of winning Wordle in at most three guesses.

Here is my solution:
[Show Solution]

## 2 thoughts on “Optimal Wordle”

1. Min Thet Khine says:

In the Bellman equation above, why does the solution not generalize for k > 2?

1. When $k=2$, the solution is relatively simple because it depends on the solution at $k=1$, which is just $1/|T|$. So there turns out to be a nice formula for it. But when $k=3$, the solution depends on the solution at $k=2$, and once you plug that in, the expression you get does not simplify as it did in the previous steps. In order to find the maximum over $w\in W$, you now have to test each $w$ and see which one gives you the larger score.