I\'ve searched a lot for this, but was unable to find something I could grasp my head around. What I\'m searching for is how to make this algorithm parallel. It doesn\'t matter
If I understand your generator expression correctly, you are trying to generate all the words with a length from 1 .. maxlength
given a certain alphabet.
I don't know exactly how you want to split your problem (do you have N
workers?), but one obvious way would be to split the list of words just by the first letter, hand those out to the various parallel workers, which then all have to append all possible combinations of words with 0 .. maxlength - 1
letters from the alphabet.