Re^4: Challenge: 8 Letters, Most Words

I am getting somehow similar results. The difference is, I guess, that I initialize the count with the number of occurrences of the combination before adding the shorter words. The script runs for 3min26s, the output ends with

adeimrst: 310
aeilnrst: 312
adeinrst: 313
aeloprst: 313
aeilnpst: 314
adeoprst: 316
adeilrst: 319
aeimprst: 328
adeiprst: 332
aeilprst: 344
aeinprst: 346
[download]

The script:

#!/usr/bin/perl
use warnings;
use strict;
use feature qw(say);


my %lc_words;
my $dict = shift;
my $FH;
open $FH, '<', $dict or $FH = *DATA;

while (<$FH>) {
    chomp;
    next if length > 8;
    my $lc = lc;
    $lc_words{$lc} = 1;
}
say scalar keys %lc_words;

my %sorted_count;

for (keys %lc_words) {
    my @letters = sort split //;
    my $sorted  = join q(), @letters;
    $sorted_count{$sorted}++;
}
say "$_: $sorted_count{$_}"
    for sort { $sorted_count{$a} <=> $sorted_count{$b} }
        keys %sorted_count;

print '-' x 78, "\n";

my %summed = %sorted_count;
for my $length (1 .. 7) {
    warn $length;
    for my $sorted (grep $length == length, keys %sorted_count) {
        my $regex = join '.*', split //, $sorted;
        for my $longer (grep $length < length, keys %sorted_count) {
            $summed{$longer} += $sorted_count{$sorted} if $longer =~ $
+regex;
        }
    }
}

say "$_: $summed{$_}"
    for sort { $summed{$a} <=> $summed{$b} }
        keys %summed;
__DATA__
ffffffff
fffffffa
afffffff
bfffffff
fffffffb
ffffbfff
a
aa
aaa
aaaa
aaaaa
aaaaaa
[download]

Update: Checking the result:

$ grep -E '^[aeinprst]{1,8}$' 2of12inf.txt  | grep -vE '(.).*\1' | wc 
+-l
346
[download]

Update 2: Testing duplicate characters:

$ grep -E '(.).*\1.*:' 1056884.out | tail -n1
aeiprsst: 279
$ grep -E '^[aeiprsst]{1,8}$' 2of12inf.txt | grep -Ev '([aeiprt]).*\1|
+s.*s.*s' | wc -l
279
[download]

لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ

Comment on Re^4: Challenge: 8 Letters, Most Words Select or Download Code

Replies are listed 'Best First'.
Re^5: Challenge: 8 Letters, Most Words by Limbic~Region (Chancellor) on Oct 05, 2013 at 03:42 UTC
choroba, I am bleary eye tired but I wanted to review your code because you mentioned it didn't consider all combinations - only possible combinations. If I have understood what you have done, this is not guaranteed to produce the correct answer on all dictionary files. It happens to get the right answer for 2of12inf.txt however. You appear to only be considering the combinations of letters of individual words rather than considering taking some from one word and some from another. Consider the following dictionary: `abcd acdb adbc dabc bcad efgh fgeh hegf egfh fegh abcdxy efghlm` [download] The obvious answer is 'abcdefgh' which will get 10 words but your code chooses both 'abcdxy' and 'efghlm' with 6 words each. Cheers - L~R	[reply] [d/l]
Re^6: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 07:27 UTC
One should probably postprocess the results if the winner is shorter than 8. I will look into it later. لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply]
Re^7: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 08:22 UTC
Something like the following? It slows the algorithm terribly, though... Read more... (3 kB) لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply] [d/l]
Re^8: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 11:28 UTC


Think about Loose Coupling
	PerlMonks