Calculates the highest score possible from the letters given, taking into account any bonuses on the squares to be covered.

(Rudimentary tool that does not handle combinations with the words already on the board).

My local newspaper has a Scrabble-based game that involves simply finding the highest scoring word from seven letters and bonus tile positions provided. Note: quite often the highest scoring word according to the newspaper is not found in my words list :-(

Specify double- and triple-word bonuses with -dw and -tw, and double- and triple-letter bonuses with -dl=N and -tl=N where N is the letter position.

Examples:

$ perl scrabble.pl eoaprzn 
Found 13,699 1-7 letter strings in eoaprzn.
Found 57 words in eoaprzn.
zap : 14

$ perl scrabble.pl eoaprzn -dw
Found 13,699 1-7 letter strings in eoaprzn.
Found 57 words in eoaprzn.
zap : 28

$ perl scrabble.pl eoaprzn -tl=3
Found 13,699 1-7 letter strings in eoaprzn.
Found 57 words in eoaprzn.
raze : 33
[download]

use strict; use warnings; use feature 'say';
use Path::Tiny;
use Algorithm::Permute;
use Number::Format 'format_number';
use List::Util 'uniq';
use Getopt::Long;

my @dl;
my @tl;
my $dw;
my $tw;
my $debug;

GetOptions(
    'dl=i' => \@dl,
    'tl=i' => \@tl,
    'dw'   => \$dw,
    'tw'   => \$tw,
    'v'    => \$debug,
);

my $input       = shift or die 'Died: No input!';
my $length      = length $input;
my @input_chars = split '', $input;

my $words_file  = '/usr/share/dict/words';
my %words       = map { $_ => 1 } path( $words_file )->lines({chomp =>
+ 1});

my %worth = (
    a => 1, b => 3,  c => 3, d => 2, e => 1,
    f => 4, g => 2,  h => 4, i => 1, j => 8,
    k => 5, l => 1,  m => 3, n => 1, o => 1,
    p => 3, q => 10, r => 1, s => 1, t => 1,
    u => 1, v => 2,  w => 2, x => 8, y => 4, z => 10,
);

my @partials;

for (1 .. $length) {
    my $P = Algorithm::Permute->new( \@input_chars, $_ );
    
    while (my @res = $P->next) {
        push @partials, join '', @res;
    }
}

@partials = uniq @partials;

say sprintf 'Found %s 1-%s letter strings in %s.',
            format_number(scalar @partials), $length, $input;

my %found = map { $_ => calc_score($_) } grep { $words{$_} } @partials
+ ;

say sprintf 'Found %s words in %s.', format_number(scalar keys %found)
+, $input;

for ( sort { $found{$b} <=> $found{$a} } keys %found ) {
    say "$_ : $found{$_}";
    last if not $debug;
}

###############

sub calc_score {
    my $word = shift;
    my $val;
    $val += $worth{$_} for split '', $word;

    $val += 50 if length $word == 7;

    return $val + calc_bonus($word, $val);
}

sub calc_bonus {
    my ($word, $val) = @_;
    my @chars = split '', $word;

    my $bonus = 0;

    for (@dl) {
        $bonus += $worth{ $chars[$_ - 1] } if $chars[$_ - 1];
    }

    for (@tl) {
        $bonus += 2 * $worth{ $chars[$_ - 1] } if $chars[$_ - 1];
    }

    $bonus += $val if $dw;
    $bonus += 2 * $val if $tw;

    return $bonus;
}

__END__
[download]

---

---

Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!

Titles consisting of a single word are discouraged, and in most cases are disallowed outright.

Read Where should I post X? if you're not absolutely sure you're posting in the right place.

Please read these before you post! —

• How do I compose an effective node title?
• How do I post a question effectively?
• Markup in the Monastery

Posts may use any of the Perl Monks Approved HTML tags:

a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr

You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)

	For:		Use:
	&		&
	<		&lt;
	>		&gt;
	[		&#91;
	]		&#93;

Link using PerlMonks shortcuts! What shortcuts can I use for linking?

See Writeup Formatting Tips and other pages linked from there for more info.