#!/usr/bin/perl use warnings; use strict; use 5.010; # defined-or, say my @tiles = (('_') x 2, # 2 blank tiles (scoring 0 points) # 1 point ('E') x 12, qw(A I) x 9, ('O') x 8, qw(N R T) x 6, qw(L S U) x 4, # 2 points ('D') x 4, ('G') x 3, # 3 points qw(B C M P) x 2, # 4 points qw(F H V W Y) x 2, # 5 points ('K'), # 8 points qw(J X), # 10 points qw(Q Z)); my $rack_size = 5; my %hash; my @rack = 0 .. $rack_size - 1; while ($rack[-1] != @tiles) { my $string = join q(), map $tiles[$_], @rack; $hash{$string}++; my $first_to_move = 0; $first_to_move++ while $rack[$first_to_move] + 1 == ($rack[$first_to_move + 1] // -1); $rack[$first_to_move]++; for my $i (0 .. $first_to_move - 1) { $rack[$i] = $i; } } my $combinations = keys %hash; my $sum = 0; $sum += $_ for values %hash; print map "$_ => " . ($hash{$_} / $sum) . "\n", sort { $hash{$a} <=> $hash{$b} } keys %hash; print "Combinations: $combinations, Count: $sum.\n"; #### use Algorithm::Combinatorics qw(combinations); my %hash; my $iterator = combinations(\@tiles, $rack_size); while (my $rack = $iterator->next) { $hash{ join q(), @$rack }++; } #### 1 ================= Rate module simple module 2953/s -- -24% simple 3883/s 31% -- 2 ================= Rate module simple module 59.1/s -- -13% simple 67.9/s 15% -- 3 ================= Rate module simple module 1.65/s -- -9% simple 1.81/s 10% -- 4 ================= (warning: too few iterations for a reliable count) (warning: too few iterations for a reliable count) s/iter module simple module 15.5 -- -2% simple 15.2 2% -- 5 ================= (warning: too few iterations for a reliable count) (warning: too few iterations for a reliable count) s/iter module simple module 328 -- -0% simple 327 0% --