https://filebin.net/pko3eyxrha59wdk3
Considering words with max 8 letters.
If we remove unlikely combinations (like 1 1 1 1 4 8 8 8 ) it can be reduced 2-3 times but with hundreds of possible words for every word length, there are still way too many combinations to go through.
I think i know how to reduce the combinations. Sort it by sum of differences from 4 4 4 4 4 4 4 4. The new list looks like:
002 3 4 4 4 4 4 4 5
002 3 4 4 4 4 4 5 4
002 3 4 4 4 4 5 4 4
002 3 4 4 4 5 4 4 4
002 3 4 4 5 4 4 4 4
002 3 4 5 4 4 4 4 4
002 3 5 4 4 4 4 4 4
002 4 3 4 4 4 4 4 5
...
The correct solution is likely to be in top 10 000 of such a list. Maybe in top 1000