The word_chewer project can currently solve for all anagrams of a single word. The program performs two processor-intensive tasks: first generating all the potential permutations of a word, then comparing them to words in a dictionary file.
For longer words, the latter is the most time-consuming. Future plans include the implementation of a red/black tree for the dictionary file, to significantly decrease the processing time. Multiple-word anagrams are also a desirable feature, though their length would likely be prohibitive until the first issue (processing time) is resolved somewhat.
What's New in This Release: [ read full changelog ]
· Fulfills the centerpiece of its functionality, but not gracefully, and with very few frills.