1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
#!/usr/bin/env perl
use strict;
use warnings;
use utf8;
use feature qw{ postderef say signatures state switch };
no warnings
qw{ experimental::postderef experimental::smartmatch experimental::signatures };
use List::Util qw{ sum0 uniq };
use Getopt::Long;
my $verbose = 0;
GetOptions(
'verbose' => \$verbose,
);
my @tiles = get_tiles();
@tiles = sort @tiles;
say join ' ', @tiles;
say '-------------';
my @list = permute_array(\@tiles);
my @list2;
for my $array ( @list ) {
for my $l ( 0 .. 6 ) {
state $dict;
my @array2 = map { $array->[$_] } 0 .. $l;
my $word2 = join '', @array2;
next if $dict->{$word2}++;
push @list2, \@array2;
}
}
my $best = '';
my $top = 0;
for my $r ( @list2 ) {
my $word = join '', $r->@*;
my $score = score_word($word);
next if $score <1;
say join "\t", '', $score,$word if $verbose;
if ( $score > $top ) {
$best = $word;
$top = $score;
}
}
say qq{ $best ($top)};
sub permute_array ( $array ) {
return $array if scalar $array->@* == 1;
my @response = map {
my $i = $_;
my $d = $array->[$i];
my $copy->@* = $array->@*;
splice $copy->@*, $i, 1;
my @out = map { unshift $_->@*, $d; $_ } permute_array($copy);
@out
} 0 .. scalar $array->@* - 1;
return @response;
}
sub get_tiles {
state $counts = counts();
my @letters = split //, join '', map { $_ x $counts->{$_} } 'a' .. 'z';
my @output;
for ( 1 .. 7 ) {
my $n = int rand scalar @letters;
my $l = $letters[$n];
splice @letters, $n, 1;
push @output, $l;
}
return wantarray ? @output : \@output;
}
sub score_word( $word ) {
state $words = words();
state $counts = counts();
state $scores = scores();
return 0 unless length $word <= 7;
return 0 unless $words->{$word};
for my $letter ( 'a' .. 'z' ) {
if ( $word =~ /$letter/ ) {
my $count = () = $word =~ /$letter/gi;
return 0 if $count > $counts->{$letter};
}
}
return sum0 map { $scores->{$_} } split //, $word;
}
sub words {
my $file = '/usr/share/dict/words';
my $words;
if ( -f $file && open my $fh, '<', $file ) {
for my $word ( map { chomp; lc $_ } <$fh> ) {
$words->{$word} = 1;
}
}
return $words;
}
sub counts {
my $counts;
map { $counts->{$_} = 2 } qw{ k q x };
map { $counts->{$_} = 3 } qw{ d f g h j l o r v };
map { $counts->{$_} = 4 } qw{ c m n };
map { $counts->{$_} = 5 } qw{ b i p t u w y z };
map { $counts->{$_} = 7 } qw{ s };
map { $counts->{$_} = 8 } qw{ a };
map { $counts->{$_} = 9 } qw{ e };
return $counts;
}
sub scores {
my $scores;
map { $scores->{$_} = 1 } qw{ a g i s u x z };
map { $scores->{$_} = 2 } qw{ e j l r v y };
map { $scores->{$_} = 3 } qw{ f d p w };
map { $scores->{$_} = 4 } qw{ b n };
map { $scores->{$_} = 5 } qw{ t o h m c };
map { $scores->{$_} = 10 } qw{ k q };
return $scores;
}
__DATA__
Lets assume we have tiles as listed below, with an alphabet (A..Z)
printed on them. Each tile has a value, e.g. A (1 point),
B (4 points) etc. You are allowed to draw 7 tiles from the
lot randomly. Then try to form a word using the 7 tiles with
maximum points altogether. You don’t have to use all the 7 tiles
to make a word. You should try to use as many tiles as possible
to get the maximum points.
For example, A (x8) means there are 8 tiles with letter A.
1 point
A (x8), G (x3), I (x5), S (x7), U (x5), X (x2), Z (x5)
2 points
E (x9), J (x3), L (x3), R (x3), V (x3), Y (x5)
3 points
F (x3), D (x3), P (x5), W (x5)
4 points
B (x5), N (x4)
5 points
T (x5), O (x3), H (x3), M (x4), C (x4)
10 points
K (x2), Q (x2)
|
