[klodolph]

I scraped qntm's wordlist and fed it to my tool, I think it does the same thing as yours (minimize the worst case after a guess... the simple greedy algorithm).

The simple greedy algorithm choses NARES first, then DOILY, then TOUCH.

And then it is left with VOUCH, COUCH, POUCH, GOUCH, MOUCH. This solver algorithm is far from optimal. It is like a 1-ply chess solver.