There are some common encoding patterns (letter weaves, morse without spaces, etc.) that we see in puzzles often but that there aren't efficient extractors for because they're used infrequently in the rest of the world. (Letter weaves can be solved by anagramming, except they tend to be long and anagramming throws away the ordering information that could make them tractable.) We should be able to say, e.g., "Bot, unweave ", perhaps with enumerations or at least a target number of threads, and have it tell us the words that could be woven to get that string. Another example might be morse code without letter or word breaks. Because Meteor's fibers are coroutines, not true threads, this may require us to implement them with manual yields, or as external processes we shell out to.
There are some common encoding patterns (letter weaves, morse without spaces, etc.) that we see in puzzles often but that there aren't efficient extractors for because they're used infrequently in the rest of the world. (Letter weaves can be solved by anagramming, except they tend to be long and anagramming throws away the ordering information that could make them tractable.) We should be able to say, e.g., "Bot, unweave", perhaps with enumerations or at least a target number of threads, and have it tell us the words that could be woven to get that string. Another example might be morse code without letter or word breaks. Because Meteor's fibers are coroutines, not true threads, this may require us to implement them with manual yields, or as external processes we shell out to.