Re^6: Challenge: 8 Letters, Most Words


XP is just a number
	PerlMonks

Re^6: Challenge: 8 Letters, Most Words

by Limbic~Region (Chancellor)

on Oct 05, 2013 at 12:57 UTC ( [id://1057027]=note: print w/replies, xml )

Need Help??

in reply to Re^5: Challenge: 8 Letters, Most Words
in thread Challenge: 8 Letters, Most Words

CountZero,
I did some more analysing the 2of12inf.txt dictionary and for words of maximum 8 characters, this is the maximum number of the same characters that can exist in any one word:

I had already done that which is where my math was coming from.

Of course that is still about 2.14 E15 combinations to check, but many of these will be the same. So, perhaps someone with more mathematical skills than I can write an efficient generator for these combinations that does not have to go through them all to weed out the duplicates.

Have you looked at my code? I already indicated that doing this reduces the number of 8 letter words that needs to be checked down to 12,461,993. The reason it grows back up to 510,106,759,469 loops/checks is because you still have to check each one of the 12.5 million against the 40K actual words. I was able to do this using C in 12 minutes.

Cheers - L~R

Comment on Re^6: Challenge: 8 Letters, Most Words

Replies are listed 'Best First'.

Re^7: Challenge: 8 Letters, Most Words
by CountZero (Bishop) on Oct 05, 2013 at 13:59 UTC

CountZero

A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

My blog: Imperial Deltronics

[reply]

In Section Seekers of Perl Wisdom