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

but the combination of auDi and forD has the 2 D's that create the solution.
  • Comment on Re^4: Another word puzzle with too many permutations

Replies are listed 'Best First'.
Re^5: Another word puzzle with too many permutations
by LanX (Saint) on Oct 15, 2013 at 18:30 UTC
    Ahhh ... so the union of the letters all words should exactly match the letter set?

    Thats - like already discussed in Limbic~Regions last "challenge" - an NP problem... :)

    update
    Well you need a branch-and-bound algorithm which recursively checks every word and bounds if to many characters are used.

    Cheers Rolf

    ( addicted to the Perl Programming Language)

[reply]
      I seem to encounter these types of problems too often and I am always amazed at some of the creative solutions that people come up with so I greatly appreciate your help.
[reply]

In Section Seekers of Perl Wisdom