https://github.com/JuanPotato/Wordle-Solver
I made a similar solver, it solves all the words in 3.65 average moves.
Could probably be better. The github explains how it works.
I made a similar solver, it solves all the words in 3.65 average moves.
Could probably be better. The github explains how it works.
1) pick a first guess, and partition the remaining words by the hints that they give
2) given any part of a partition, pick a word that minimizes the maximum-size part of the resulting sub-partition
3) repeat (2) until words are solved.
My tree is quite different from yours, with guess distribution 1, 103, 861, 1114, 212, 24.
I think your heuristic is pretty similar to mine, just accomplished in a different way.