Re^3: Another word puzzle with too many permutations

Well, I ran your code using my 4 car example and it gave the right solution. I had mixed results with the dogs but it could be an issue on my side. I am running some more tests but I think this may be the path to what I am looking for. Thank you for taking the time to put a working script together.

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

Replies are listed 'Best First'.
Re^4: Another word puzzle with too many permutations by MidLifeXis (Monsignor) on Oct 15, 2013 at 19:00 UTC
The issue was mentioned on a different node. You specify an alphabet, but your data contains characters not contained in that alphabet. You can either filter the characters that you are not checking ('-', '.'), add them to the alphabet, or remove them from the data in your list of items. --MidLifeXis	[reply]
Re^5: Another word puzzle with too many permutations by sarchasm (Acolyte) on Oct 15, 2013 at 21:11 UTC
Your code works great with the smaller sets of data. When I try to run it against a 250 item list, it runs out of memory. Is it possible to only output results that consume all available letters for a specific amount of words? ie: I need exactly 10 words that use all of the given letters to have a solution.	[reply]
Re^6: Another word puzzle with too many permutations by MidLifeXis (Monsignor) on Oct 16, 2013 at 12:00 UTC
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	[reply] [d/l]