Forum Discussion
Lookup five characters appearing in any order in a wordlist
Your third line "te" is missing a letter, but we can ignore that for our purposes.
*Yes, "absolute - exist" is okay. There can be redundancy.
*Yes, the first letter of the second word must be the last letter of the first word.
*Yes, you can use all the puzzle letters with three words "bobs - salute - exist," but I don't care to solve for that. I only want to solve for two words.
*Boundless is illegal because of the two ss. In your example letters, boundless would also be illegal because o and u are adjacent, and they appear together on one side of the square "olu."
*If your wordlist is too short, solutions may not be possible. I use the Scrabble word list. It doesn't have all the words that the puzzle maker uses, but it's close enough.
The adjacent letters rule is not as straightforward
why o and u are adjacent？
at last summary：
Have 12 unique letters.
Divided to 2 or 3 groups, each group should be part of an English word regardless of sequence。
The expected result are two English or 3 English words.
Each word in those 2 or 3 words,all letters should be unique. e.g. class boundless are illegal.
And the last letter of the first word should be the first letter of the second word and the first letter of third same as the last of second word. head letter same as former foot letter.
Hi,
o and u are adjacent in the word doubtless, and o and u come from the same side of the square. The letters on the square can be in any order. We only look at the word for adjacency.
The pair, class - boundless are illegal because they have adjacent letters... s s and o u.
It is possible to solve the puzzle with two or more words that use letters from the square, each word's letters unique as to the other words, but that is not necessary. As you can see in the list below, letters from the square can be used multiple times in all the words that solve the puzzle, so long as none of the words have adjacent letters from the same side.
As I indicated previously, I only care about two-word solutions.
I am still working on a way to find all matches, not just the first one in the list.
Thank you for your help.
