Re^5: Another word puzzle with too many permutations

[sarchasm]

Your code works great with the smaller sets of data. When I try to run it against a 250 item list, it runs out of memory. Is it possible to only output results that consume all available letters for a specific amount of words? ie: I need exactly 10 words that use all of the given letters to have a solution.

[MidLifeXis]

My solution calls success any set of names that map to a subset of the alphabet. Change the definition of success to a set of names that fully exhaust the alphabet (@alphabet contains all 0s).