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 reply to Re^6: Another word puzzle with too many permutations
by MidLifeXis
in thread Another word puzzle with too many permutations
by sarchasm
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |