Hacker News Reader

This is by defintion suboptimal, as you'd ignore information gain from each guess.

Only the first guess is "unbounded"

this is a specific limitation I'm imposing because it makes for an interesting problem, not because its meant to be optimal.

If you were careful, you could cover 25 of 26 letters in 5 guesses.

Been there, done that!