cyanmatter / sloan Goto Github PK

This project is in development. In this case that means that there are several planned features yet to be implemented and major bugs to be fixed.

This is a command line program that will simply list all possible anagrams that can be made from an input sentence. It applies a user-submitted word list, although a default list is provided as well.

An anagram is a word or phrase that is formed by rearranging the letters of a different word or phrase. SLoAn uses all the original letters exactly once to arrive at its solutions.

SLoAn is a hobby project. I'm fascinated by the idea that this simple game with one rule becomes computationally exponentionally more intensive the more characters are added to the phrase. The challenge is to discover a way to drastically reduce the amount of letter rearrangements that have to be processed to arrive at an absolute answer. The goal is to deliver all possible anagrams, quick. And then accordingly, the short processing time will allow for long inputs to be admissible as well.

SLoAn "learns" by doing. It gets faster processing new unique phrases the more it solved in the past. Anytime a little bit of the puzzle is solved, that solution is stored for quick look-up in the future. In effect, the algorithm gets increasingly more familiar with its word list the more queries it completes.

(back to top)