The 538 possible solutions are not permutations, and are drawn from the set of 5977 unique non-anagram 5 letter words that can be extracted from words_alpha.txt

The 538 possible solutions are not permutations, and are drawn from the set of 5977 unique non-anagram 5 letter words that can be extracted from words_alpha.txt. There are 536 solutions that include the letter "m". https://docs.google.com/spreadsheets/d/11sUBkPSEhbGx2K8ah6WbGV62P8ii5l5vVeMpkzk17PI https://docs.google.com/spreadsheets/d/11sUBkPSEhbGx2K8ah6Wb... That's a spread-sheet of the various solutions as maintained by Benjamin Paassen, who was the author of the user-submitted solution featured in Matt's video. The times he presents are from being on his own system. Some of the solutions listed there have advanced since Benjamin ran them. I wish you all the best! It's a fun little challenge to code for.