Durak/Search.pm untested

filter: Statementstmt 0.0% 0 / 61 Branchbran 0.0% 0 / 28 Conditioncond 0.0% 0 / 25 MC/DCmcdc 0.0% 0 / 14 Subroutinesub 0.0% 0 / 11 Podpod 0.0% 0 / 6 totaltotal 0.0% 0 / 145 CC 15 SCAR 34.2
CC
15
Cov
0%
best
72.0
_cost
20.0
_defend
20.0
CRAP 30.5
1 package Game::Durak::Search;
2  
3 use strict;
4 use warnings;
5  
6 use Exporter 'import';
7  
8 use Game::Durak::Card qw(rank_of suit_of power_of);
9  
10 our $VERSION = '0.04';
11 our @EXPORT_OK = qw(best LEVELS);
12  
13 use constant LEVELS => 3;
14  
15 our $DEEP_TALON = 6;
16 our $CHEAP_POWER = 3;
17  
18 sub _held_twice {
19 my ($hand) = @_;
20 my %seen;
21 $seen{ rank_of($_) }++ for @$hand;
22 return \%seen;
23 }
24  
25 sub _cost {
26 my ($card, $trump, $ranks, $pairs_are_good) = @_;
27 my $cost = power_of($card);
28 $cost += 20 if suit_of($card) eq $trump;
29 $cost += $pairs_are_good ? -2 : 1 if $ranks->{ rank_of($card) } > 1;
30 return $cost;
31 }
32  
33 sub _cheapest_first {
34 my ($moves, $trump, $ranks, $pairs_are_good) = @_;
35 return [ sort {
36 _cost($a->{card}, $trump, $ranks, $pairs_are_good)
37 <=> _cost($b->{card}, $trump, $ranks, $pairs_are_good)
38 || $a->{card} <=> $b->{card}
39 } @$moves ];
40 }
41  
42 sub _defend {
43 my ($view, $level, $by) = @_;
44  
45 my $beats = $by->{beat} || [];
46 return $by->{take}[0] unless @$beats;
47  
48 my $ranks = _held_twice($view->{hand});
49 my $sorted = _cheapest_first($beats, $view->{trump}, $ranks);
50 my $pick = $sorted->[0];
51  
52 return $pick if $level < 3 || !$by->{take};
53  
54 my $card = $pick->{card};
55 return $by->{take}[0]
56 if suit_of($card) eq $view->{trump}
57 && power_of($card) > $CHEAP_POWER
58 && $view->{talon} > $DEEP_TALON
59 && $view->{bout}{size} <= 2;
60  
61 return $pick;
62 }
63  
64 sub _attack {
65 my ($view, $level, $by) = @_;
66  
67 my $attacks = $by->{attack} || [];
68 return $by->{done}[0] unless @$attacks;
69  
70 my $ranks = _held_twice($view->{hand});
71 my $sorted = _cheapest_first($attacks, $view->{trump}, $ranks,
72 $level >= 3);
73  
74 return $sorted->[0];
75 }
76  
77 sub best {
78 my ($view, $level, $word) = @_;
79  
80 my $legal = $view->{legal};
81 return undef unless $legal && @$legal;
82  
83 $level = 1 unless defined $level && $level >= 1;
84 $level = LEVELS if $level > LEVELS;
85 $word = 0 unless defined $word;
86  
87 return $legal->[ $word % scalar @$legal ] if $level == 1;
88  
89 my %by;
90 push @{ $by{ $_->{kind} } }, $_ for @$legal;
91  
92 return $by{swap}[0] if $by{swap};
93  
94 return $view->{phase} eq 'defend'
95 ? _defend($view, $level, \%by)
96 : _attack($view, $level, \%by);
97 }
98  
99 1;
100  
101 __END__