Re^5: Another word puzzle with too many permutations

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

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)

Comment on Re^5: Another word puzzle with too many permutations

Replies are listed 'Best First'.
Re^6: Another word puzzle with too many permutations by sarchasm (Acolyte) on Oct 15, 2013 at 18:50 UTC
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]