Anonymous Monk has asked for the
wisdom of the Perl Monks concerning the following question:
a weekly paper here is printing a word jumble puzzle. was wondering if it's possible with regex to scan a dictionary file for matches. puzzle rules: you get nine letters, each letter can only be used once. example: "RTESAMCNA", the longest word = SACRAMENT. oh wise ones, how to construct a regex so that each letter (from the letter pool) can only be used once?
this is not a homework question....i stopped doing homework in 1994.