A noble endeavor. By all means please report what you find! You can get pretty far by hand if you fix the difficult letters first, like Q, J, F, V, W, ... roughly in reverse order of Scrabble tile score. The web page http://www.fun-with-words.com/pang_example.html lists these "perfect pangrams': (26) Mr. Jock, TV quiz PhD, bags few lynx. (26) Cwm fjord-bank glyphs vext quiz. (26) Blowzy night-frumps vex'd Jack Q. (26) Squdgy fez, blank jimp crwth vox! (26) TV quiz drag nymphs blew JFK cox. (26) Q-kelt vug dwarf combs jynx phiz. Based on the length of time people have sought perfect pangrams, what I know about wordplay records, the large number of computer science people who enjoy word recreations, and the 6 pangrams mentioned above, I will go out on a limb and predict that if Keith finds any new perfect pangrams, they won't be much more satisfactory than those are, if at all. —Dan ----- Bill Gosper's recent anagrams reminded me of my search for a perfect pangram, i.e. a sentence in English containing every letter once and only once. For instance, "Cwm fjord bank glyphs vext quiz" and "Mr. Jock, TV quiz PhD, bags few lynx," neither of which is really satisfactory. My approach was to find a complete list of words, discard any words containing duplicate letters (e.g. "containing," as it contains two "n"s (and also two "i"s)), turn each of them into a 32-bit integer which indicates which letters are present ("of" becomes 2^4 + 2^13 as it contains the 5th and 14th letters). Anagrams are merged (e.g. the numbers for "opts," "post," "pots," "spot," "stop," and "tops" are the same). A depth-first tree search is then done during which the numbers are ORed together. If an AND gets a non-zero result, the branch is immediately abandoned. If 2^26-1 is reached, the result is logged, so that I can manually try to arrange the words (or anagrams of them) into a coherent sentence. I tried this about 30 years ago, on a 286. Needless to say, I didn't get anywhere. It probably would have run for eons. I'm considering trying again, on the same general plan, but only with the most common ten thousand words. Better yet, the most common thousand words containing "a", the most common thousand words containing "b", ..., and the most common thousand words containing "z," with the many duplicates merged, for a total of perhaps ten thousand. I might also include the most common thousand words *not* containing "a", the most common thousand words not containing "b", ..., and the most common thousand words not containing "z." Again, duplicates would be merged. And words that are anagrams would move up in the rankings as the usage of each anagram would be summed as if they were all the same word. With memory as cheap as it is, I might also include every *pair* of words in the list as a word, even though that would increase memory usage from 40 kilobytes to 400 megabytes. Has anyone tried this already? Does anyone have a better algorithm? Thanks. -----