There are thousands of ten-letter groups that form eight different words, so it is necessary to restrict the conditions of the problem. First, the ten letters must form a word; second, all ten letters must be different; third, the solution must be unique (only one tree arrangement is possible). If one restricts the eight words to the Official Scrabble Players Dictionary (1995), there are still at least 28 solutions:
The obvious generalization is to arrange 15 letters in a tree to generate 16 different words. Here it seems advisable to relax the three conditions. Again drawing words from the OSPD, one can construct several families of solutions. For example, the first solution places B E in place of the + + along the left edge of the tree, and A N in place of the--along the right edge of the tree.
Editor's Note: Many more solutions are possible if one enlarges the word stock. For example, using Webster's Second the letter tree s-ht-eao-lnrw-fdeks (shelf, sheld, shend, shene, shand, shane, share, shark, stand, stane, stare, stark, store, stork, stowk, stows) has at least 168 relatives in its extended family. It may be time to issue a challenge to the reader to find a letter tree consisting of 32 different six-letter words. Even a letter tree consisting of 64 seven-letter words may be possible if a sufficiently large set of words is used (Rex Gooch?).
|Printer friendly Cite/link Email Feedback|
|Date:||May 1, 2005|
|Next Article:||It's a sonnet (not sestina).|
|A christmas code.|
|Peppertree: the logological holy grail.|
|Enlarging English tautonyms.|