-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathhand_rank.py
289 lines (277 loc) · 9.21 KB
/
hand_rank.py
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
from dealer import Dealer
import bisect
class HandRank:
def RoyalFlush(player, CommunityCards):
ordered = []
best = []
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for y in range (0, 5):
bisect.insort(ordered, CommunityCards[y].rank_)
if (ordered[0] == 1): #If there is an A in the players hand or community cards
del ordered[0]
ordered.append(14) #append rank (14) as 7th card for some hand combinations to be possible
if (HandRank.StraightFlush(player, CommunityCards) and (ordered[2] == 10) and (ordered[3] == 11) and (ordered[4] == 12) and (ordered[5] == 13) and (ordered[6] == 14)):
best = ordered[6:2]
return best
else:
for a in range (0,5): #If there is no 3 of a kind return 5 element list with all zeros
best.append(0)
return best
def StraightFlush(player, CommunityCards):
best = []
if (((HandRank.Flush(player, CommunityCards))[0] != 0) and (HandRank.Straight(player, CommunityCards)[0] != 0) and (HandRank.Flush(player, CommunityCards)) == (HandRank.Straight(player, CommunityCards))):
best = (HandRank.Straight(player, CommunityCards))
return best
else:
for a in range (0,5): #If there is no 3 of a kind return 5 element list with all zeros
best.append(0)
return best
def FourOfAKind(player, CommunityCards):
ordered = []
best = []
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for y in range (0, 5):
bisect.insort(ordered, CommunityCards[y].rank_)
for y in range (0, 4):
if (ordered[y+3] == ordered[y+2] == ordered[y+1] == ordered[y]):
if (ordered[y] == 1):
best.append(14)
best.append(14)
best.append(14)
best.append(14)
best.append(max(ordered))
return best
else:
best.append(ordered[y])
best.append(ordered[y])
best.append(ordered[y])
best.append(ordered[y])
ordered[y] = 0
ordered[y+1] = 0
ordered[y+2] = 0
ordered[y+3] = 0
best.append(max(ordered))
return best
for a in range (0,5): #If there is no 3 of a kind return 5 element list with all zeros
best.append(0)
return best
def FullHouse(player, CommunityCards):
ordered = []
best =[]
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for y in range (0, 5):
bisect.insort(ordered, CommunityCards[y].rank_)
for y in range (0, 3):
for x in range (0, (3-y)):
if (ordered[y+2] == ordered[y+1] == ordered[y]) and (ordered[6-x] == ordered[5-x]):
best.append(ordered[6-x])
best.append(ordered[6-x])
best.append(ordered[y])
best.append(ordered[y])
best.append(ordered[y])
return best
elif (ordered[x+1] == ordered[x]) and (ordered[6-y] == ordered[5-y] == ordered[4-y]):
best.append(ordered[4-y])
best.append(ordered[4-y])
best.append(ordered[4-y])
best.append(ordered[x])
best.append(ordered[x])
return best
for a in range (0,5): #If there is no 3 of a kind return 5 element list with all zeros
best.append(0)
return best
def Flush(player, CommunityCards):
club = 0
diamond = 0
heart = 0
spade = 0
club_cardranks = []
diamond_cardranks = []
heart_cardranks = []
spade_cardranks = []
nothing = []
for y in range (0, 2):
if (player[y].suit_ == 1):
club += 1
bisect.insort(club_cardranks,player[y].rank_)
elif (player[y].suit_ == 2):
diamond += 1
bisect.insort(diamond_cardranks,player[y].rank_)
elif (player[y].suit_ == 3):
heart += 1
bisect.insort(heart_cardranks,player[y].rank_)
else:
spade += 1
bisect.insort(spade_cardranks,player[y].rank_)
for x in range (0, 5):
if (CommunityCards[x].suit_ == 1):
club += 1
bisect.insort(club_cardranks,CommunityCards[x].rank_)
elif (CommunityCards[x].suit_ == 2):
diamond += 1
bisect.insort(diamond_cardranks,CommunityCards[x].rank_)
elif (CommunityCards[x].suit_ == 3):
heart += 1
bisect.insort(heart_cardranks,CommunityCards[x].rank_)
else:
spade += 1
bisect.insort(spade_cardranks,CommunityCards[x].rank_)
if (club >= 5):
if (club_cardranks[0] == 1):
club_cardranks.append(14)
del club_cardranks[0]
return list(reversed(club_cardranks))
elif (diamond >= 5):
if (diamond_cardranks[0] == 1):
diamond_cardranks.append(14)
del diamond_cardranks[0]
return list(reversed(diamond_cardranks))
elif (heart >= 5):
if (heart_cardranks[0] == 1):
heart_cardranks.append(14)
del heart_cardranks[0]
return list(reversed(heart_cardranks))
elif (spade >= 5):
if (spade_cardranks[0] == 1):
spade_cardranks.append(14)
del spade_cardranks[0]
return list(reversed(spade_cardranks))
else:
for a in range (0,5): #If there is no 3 of a kind return 5 element list with all zeros
nothing.append(0)
return nothing
"""
if ((club or diamond or heart or spade) >= 5):
return True
else:
return False
"""
def Straight(player, CommunityCards):
ordered = []
best =[]
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for y in range (0, 5):
bisect.insort(ordered, CommunityCards[y].rank_)
if (ordered[0] == 1): #If there is an A in the players hand or community cards
ordered.append(14) #append rank (14) as 7th card for some hand combinations to be possible
else:
ordered.append(0) # If not append None (Null)
for y in range (0, 4):
if (ordered[y+1] == ordered[y] + 1) and (ordered[y+2] == ordered[y] + 2) and (ordered[y+3] == ordered[y] + 3) and (ordered[y+4] == ordered[y] + 4):
best.append(ordered[y+4])
best.append(ordered[y+3])
best.append(ordered[y+2])
best.append(ordered[y+1])
best.append(ordered[y])
return best
for y in range (0, 3):
#In case of a Combination like (3, 3, 4, 4, 5, 6, 7) below if statement can still identify the straight HandRank hand from ordered list
if (ordered[y+2] == ordered[y] + 1) and (ordered[y+3] == ordered[y] + 2) and (ordered[y+4] == ordered[y] + 3) and (ordered[y+5] == ordered[y] + 4):
best.append(ordered[y+5])
best.append(ordered[y+4])
best.append(ordered[y+3])
best.append(ordered[y+2])
best.append(ordered[y])
return best
for a in range (0,5): #If there is no 3 of a kind return 5 element list with all zeros
best.append(0)
return best
def ThreeOfAKind(player, CommunityCards):
ordered = []
best = []
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for y in range (0, 5):
bisect.insort(ordered, CommunityCards[y].rank_)
for y in range (0, 5):
if (ordered[y+1] == ordered[y]) and (ordered[y+2] == ordered[y]):
if (ordered[y] == 1): #If three of a kind is with Ace use value 14
best.append(14)
best.append(14)
best.append(14)
best.append(ordered[-1]) #Highest 2 kicker cards
best.append(ordered[-2])
return best
else:
best.append(ordered[y])
best.append(ordered[y])
best.append(ordered[y])
del ordered[y]
del ordered[y]
del ordered[y]
best.append(ordered[-1]) #Highest 2 kicker cards
best.append(ordered[-2])
return best
for a in range (0,5): #If there is no 3 of a kind return 5 element list with all zeros
best.append(0)
return best
def TwoPair(player, CommunityCards):
ordered = []
best = []
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for y in range (0, 5):
bisect.insort(ordered, CommunityCards[y].rank_)
for y in range (0, 3):
for x in range (0, 3):
if (ordered[6-y] == ordered[5-y]) and (ordered[3-x] == ordered[2-x]):
best.insert(0,ordered[6-y])
best.insert(0,ordered[6-y])
if (ordered[3-x] != 1):
best.insert(2,ordered[3-x])
best.insert(2,ordered[3-x])
else:
best.insert(0, 14)
best.insert(0, 14)
ordered[6-y] = 0
ordered[5-y] = 0
ordered[3-x] = 0
ordered[2-x] = 0
best.append(max(ordered))
return best
for a in range (0,5):
best.append(0)
return best
def OnePair(player, CommunityCards):
ordered = []
zero = []
result =[]
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for x in range (0, 5):
bisect.insort(ordered, CommunityCards[x].rank_)
for y in range (0, 6):
if (ordered[y] == ordered[y+1]):
if (ordered[y] == 1):
del ordered[0]
ordered.append(14) #append rank (14) as 7th card for some hand combinations to be possible
del ordered[0]
ordered.append(14) #append rank (14) as 7th card for some hand combinations to be possible
return list(reversed(ordered[2:7]))
else:
result.append(ordered[y])
result.append(ordered[y+1])
del ordered[y]
del ordered[y]
result.append(ordered[-1])
result.append(ordered[-2])
result.append(ordered[-3])
return result
zero.append(0)
return zero
def HighCard(player, CommunityCards): #HighCard returns the Rank value of the highest card
ordered = []
ordered.append(player[0].rank_)
bisect.insort(ordered, player[1].rank_)
for y in range (0, 5):
bisect.insort(ordered, CommunityCards[y].rank_)
if (ordered[0] == 1): #If there is an A in the players hand or community cards
del ordered[0]
ordered.append(14) #append rank (14) as 7th card for some hand combinations to be possible
return list(reversed(ordered[2:7]))
else:
return list(reversed(ordered[2:7]))