-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathHand.hs
More file actions
173 lines (147 loc) · 5.54 KB
/
Hand.hs
File metadata and controls
173 lines (147 loc) · 5.54 KB
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
162
163
164
165
166
167
168
169
170
171
172
173
{-
A hand is a collection of 5 cards.
This file also includes the functions supporting the most naive way of ranking hands
-}
module Hand (
Hand(..), -- TODO eliminate the destructuring and hence the need for .
Category(..),
GroupedRanks,
biggestGroup,
biggestValue,
secondBiggestValue,
thirdBiggestValue,
smallestValue,
isThreeTwoGroup,
isTwoTwoOneGroup,
isTwoOneOneOneGroup,
isThreeOneOneGroup,
groupSize,
mkHand,
sortHand,
allSameSuit,
contiguousRanks,
maxRankInStraight,
getGroupedRanks,
) where
import Card (Card,getRank,getSuit,Rank(..))
import Data.Ord (comparing)
import TupleSort (tuple5SortBy)
data Hand = Hand (Card,Card,Card,Card,Card) deriving Show
data Category = CStraightFlush | CFourOfAKind | CFullHouse | CFlush
| CStraight | CThreeOfAKind | CTwoPairs | COnePair
| CHighCard deriving (Eq,Ord,Show)
sortHand :: Hand -> Hand
sortHand (Hand x) = Hand y
where
y = tuple5SortBy (comparing getRank) x
mkHand :: (Card,Card,Card,Card,Card) -> Hand
mkHand x = Hand x
data GroupedRanks = FourOneGroup Rank Rank
| ThreeTwoGroup Rank Rank
| ThreeOneOneGroup Rank Rank Rank
| TwoTwoOneGroup Rank Rank Rank
| TwoOneOneOneGroup Rank Rank Rank Rank
| OneOneOneOneOneGroup Rank Rank Rank Rank Rank
biggestValue :: GroupedRanks -> Rank
biggestValue (FourOneGroup a _) = a
biggestValue (ThreeTwoGroup a _) = a
biggestValue (ThreeOneOneGroup a _ _) = a
biggestValue (TwoTwoOneGroup a _ _) = a
biggestValue (TwoOneOneOneGroup a _ _ _) = a
biggestValue (OneOneOneOneOneGroup a _ _ _ _ ) = a
secondBiggestValue :: GroupedRanks -> Rank
secondBiggestValue (FourOneGroup _ a) = a
secondBiggestValue (ThreeTwoGroup _ a) = a
secondBiggestValue (ThreeOneOneGroup _ a _) = a
secondBiggestValue (TwoTwoOneGroup _ a _) = a
secondBiggestValue (TwoOneOneOneGroup _ a _ _) = a
secondBiggestValue (OneOneOneOneOneGroup _ a _ _ _ ) = a
thirdBiggestValue :: GroupedRanks -> Rank
thirdBiggestValue (ThreeOneOneGroup _ _ a) = a
thirdBiggestValue (TwoTwoOneGroup _ _ a) = a
thirdBiggestValue (TwoOneOneOneGroup _ _ a _) = a
thirdBiggestValue (OneOneOneOneOneGroup _ _ a _ _) = a
thirdBiggestValue _ = error "There is no third biggest value"
smallestValue :: GroupedRanks -> Rank
smallestValue (FourOneGroup _ a) = a
smallestValue (ThreeTwoGroup _ a) = a
smallestValue (ThreeOneOneGroup _ _ a) = a
smallestValue (TwoTwoOneGroup _ _ a) = a
smallestValue (TwoOneOneOneGroup _ _ _ a) = a
smallestValue (OneOneOneOneOneGroup _ _ _ _ a) = a
groupSize :: GroupedRanks -> Int
groupSize (FourOneGroup _ _) = 2
groupSize (ThreeTwoGroup _ _) = 2
groupSize (ThreeOneOneGroup _ _ _) = 3
groupSize (TwoTwoOneGroup _ _ _) = 3
groupSize (TwoOneOneOneGroup _ _ _ _) = 4
groupSize (OneOneOneOneOneGroup _ _ _ _ _) = 5
allEqual3 :: Eq a => a -> a -> a -> Bool
allEqual3 a b c = a == b && b == c
allEqual4 :: Eq a => a -> a -> a -> a -> Bool
allEqual4 a b c d = a == b && b == c && c == d
biggestGroup :: GroupedRanks -> Int
biggestGroup (FourOneGroup _ _) = 4
biggestGroup (ThreeTwoGroup _ _) = 3
biggestGroup (TwoTwoOneGroup _ _ _) = 2
biggestGroup (TwoOneOneOneGroup _ _ _ _) = 2
biggestGroup (OneOneOneOneOneGroup _ _ _ _ _) = 1
isThreeOneOneGroup :: GroupedRanks -> Bool
isThreeOneOneGroup (ThreeOneOneGroup _ _ _) = True
isThreeOneOneGroup _ = False
isThreeTwoGroup :: GroupedRanks -> Bool
isThreeTwoGroup (ThreeTwoGroup _ _) = True
isThreeTwoGroup _ = False
isTwoTwoOneGroup :: GroupedRanks -> Bool
isTwoTwoOneGroup (TwoTwoOneGroup _ _ _) = True
isTwoTwoOneGroup _ = False
isTwoOneOneOneGroup :: GroupedRanks -> Bool
isTwoOneOneOneGroup (TwoOneOneOneGroup _ _ _ _) = True
isTwoOneOneOneGroup _ = False
-- Take advantage that they are already sorted by rank
getGroupedRanks :: Hand -> GroupedRanks
getGroupedRanks (Hand (a',b',c',d',e'))
| allEqual4 a b c d = FourOneGroup a e
| allEqual4 b c d e = FourOneGroup e a
| allEqual3 a b c && d == e = ThreeTwoGroup a e
| allEqual3 c d e && a == b = ThreeTwoGroup c a
| allEqual3 a b c && d /= e = ThreeOneOneGroup a e d
| allEqual3 b c d && a /= e = ThreeOneOneGroup b e a
| allEqual3 c d e && a /= b = ThreeOneOneGroup c b a
| a == b && c == d = TwoTwoOneGroup c a e
| a == b && d == e = TwoTwoOneGroup d a c
| b == c && d == e = TwoTwoOneGroup d b a
| a == b = TwoOneOneOneGroup a e d c
| b == c = TwoOneOneOneGroup b e d a
| c == d = TwoOneOneOneGroup c e b a
| d == e = TwoOneOneOneGroup d c b a
| otherwise = OneOneOneOneOneGroup e d c b a
where
a = getRank a'
b = getRank b'
c = getRank c'
d = getRank d'
e = getRank e'
allSameSuit :: Hand -> Bool
allSameSuit (Hand (a,b,c,d,e)) = getSuit a == getSuit b && getSuit b == getSuit c &&
getSuit c == getSuit d && getSuit d == getSuit e
contiguousRanks :: Hand -> Bool
contiguousRanks (Hand (a,b,c,d,e))
| not (a' /= b' && b' /= c' && c'/=d' && d'/=e') = False
| (a' == Two && e' == Ace) && firstFourCardsContiguous = True
| otherwise = firstFourCardsContiguous && d' /= Ace && succ d' == e'
where
a' = getRank a
b' = getRank b
c' = getRank c
d' = getRank d
e' = getRank e
firstFourCardsContiguous = succ a' == b' && succ b' == c' && succ c' == d'
-- Assumed that it is already a straight!
maxRankInStraight :: Hand -> Rank
maxRankInStraight (Hand (a,_,_,_,e))
| e' == Ace && a' == Two = Five
| otherwise = e'
where
a' = getRank a
e' = getRank e