in reply to Re^5: Another word puzzle with too many permutations
in thread Another word puzzle with too many permutations

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).

--MidLifeXis

In Section Seekers of Perl Wisdom