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

I am very intrigued by this approach and will explore it a bit more. I should end up with a list of the "10" words that use all of the available letters. Also, I checked the resulting output and it doesn't include "Xolitzcuintli" but that's because I forgot to include 1 "Z". It does appear in the output when I set Z to 1. This does leave me with a much smaller list but I would still have to identify the 10 words out of the 72 that create the solution.
  • Comment on Re^2: Another word puzzle with too many permutations

Replies are listed 'Best First'.
Re^3: Another word puzzle with too many permutations
by LanX (Saint) on Oct 15, 2013 at 18:23 UTC
    > that use all of the available letters

    please be precise, AUDI has only one D in the example given.

    changing my code to show only exact matches is no problem, just check at the end if all values are 0.

    Cheers Rolf

    ( addicted to the Perl Programming Language)

[reply]
      but the combination of auDi and forD has the 2 D's that create the solution.
[reply]
        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]

In Section Seekers of Perl Wisdom