Open JustAnotherArchivist opened 1 month ago
Yes, sorry about that unfriendly error message. It uses an internal coding of two bits per letter in order to pack the letter counts into 64 bits (26x2≤64), so it can handle letters that occur up to three times. This works for the original wordlist as that doesn't contain any words with ≥4 of the same letter, and it just rejects wordlists with ≥4 of the same letter. It wouldn't be hard to adapt this to cater for some letters (up to 12=64-26x2 of them) that occur ≥4 times and still pack this into 64 bits. Or could take a slight efficiency hit and go to 128 bits for the counts.
I was trying to run this with a word list that includes Roman numerals, some of which contain four equal letters, e.g.
xxxix
. This causeswordle
to crash with an assertion error: