in reply to Optimising combinatorial iterations by filtration
Maybe this will help you generate a lookup table.
The number of truly different five card poker hands is not that large. Brute force is good enough to list all 7462 of them.
First, forget about suits, and generate all combinations of ranks. Sort them and join them in a string. Count the number of unique ranks in the hand. If it is one, the combination is no good (five aces). If it is five, a flush is possible.
Rank all hands from 0..7461 and you have a quick lookup.
Update:
Deal a few hundred random outcomes and tally the results.
YuckFold
#!/usr/bin/perl use strict; my @chars = 'a'..'m'; my %hands; for my $c0 (@chars) { for my $c1 (@chars) { for my $c2 (@chars) { for my $c3 (@chars) { for my $c4 (@chars) { my $list = [$c0, $c1, $c2, $c3, $c4]; my $uniq = unique_ranks($list); my $key = join('', sort @$list ); # is a valid hand if ($uniq > 1) { $hands{$key}++; } # can be flushed if ($uniq > 4) { $hands{"$key+"}++; } } } } } } for my $key (sort(keys(%hands))) { $key =~ tr/a-m/AKQJT98765432/; print "$key\n"; } #----------------------------------------------------------- sub unique_ranks { my $list = shift; my %uniq = map { ($_ => 1) } @$list; return keys %uniq; }
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Optimising combinatorial iterations by filtration
by Moron (Curate) on Mar 12, 2007 at 13:34 UTC |
In Section
Seekers of Perl Wisdom