-
Notifications
You must be signed in to change notification settings - Fork 10
/
ace_eval_unroll.c
232 lines (212 loc) · 6.95 KB
/
ace_eval_unroll.c
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
/* Mini poker hand evaluator.
* Takes a hand of 5-7 cards,
* returns a 32 bit int representing its rank.
*
* Cards are stored in a 32 bit word which has the following (implied) structure:
struct card{
unsigned num_A:2;
unsigned num_K:2;
unsigned num_Q:2;
//....
unsigned num_2:2;
unsigned spare:2;
unsigned spade:1;
unsigned heart:1;
unsigned diamond:1;
unsigned club:1;
};
*/
#include <stdint.h>
#include "ace_eval.h"
/*
compressor: turn 26 bit-pairs into 13 bits
*/
Card C,i,X;
//#define c(a)for(X=a,i=C=0;X;X/=4}C|=(X&1)<<i++;
Card compress(Card a){
int i=0;
Card out=0;
for (i;a;i++){
out|=(a&1)<<i;
a/=4;
}
return out/8;
}
/* Add a card to the hand with the `A` macro:
The hand is stored as an array of 5 ints. The low 3 bits are used to select a suit,
(h[0]=spade,h[1]=club,h[2]=diamond,h[4]=heart).
The cards are added to the suit - since only one suit bit is set, 3 of the low 8 bits
will contain a count of the cards in that suit (that's why the spare is where it is).
h[3] has a single bit set for each card present, used for straight detection
*/
#define A(h,c)h[c&7]+=c,h[3]|=c
/* a few globals
*/
/* The evaluator function:*/
Card E(Card h[]){
/*variables:
a: the sum of all suits. counts the ranks in paralell.
But there are only 2 bits used to store each rank, so 4 of a kind will overflow.
We fix that by subtracting h[3] which has a 1 for each rank actually in the hand.
So now every 2-bit field holds the count-1 for that rank.
e: evens - it has a bit set in any rank which has a 1(pair) or 3(quad).
o: odds - it has a bit for every 2(set) or 3(quad).
t: type: will hold the type of hand:
9= stfl. straight flush.
7= quad. 4 of a kind
6= boat. full house
5= flsh. flush
4= run. straight.
3= set. 3 of a kind
2= 2pr 2 pair
1= pair.
0= hi-c. high card.
v: value - the cards that determine the hand value. (eg: pair aces vs pair kings)
k: kicker - will hold the tiebreak card(s) (eg: KKA21 vs KKQ21)
*/ /* *h */
Card count=h[0]+h[1]+h[2]+h[4]-(h[3]&-16L);
Card evens=0x55555540&count;
Card odds =0xAAAAAA80&count;
Card result = 0;
Card value;
Card kicker =h[3];
Card temp;
/* Quad detector: the value `v=e&o/2` will be non-zero only if a rank has both
the even and odd bit set, meaning its count-1 is 3.
The while loop clears all except the top bit of the remaining to find the kicker `k`.
Type is stored in `t`
*/
if(value=evens&odds/2){
kicker=h[3]^value;
while(temp=kicker&kicker-1)
kicker=temp;
return 7<<28|compress(value)<<13|compress(kicker);
}
/* Full House detector:
The first line catches 2 sets (odds counter has 2 bits set).
It separates the bits into high set, in `value` and the pair in `k`
The the second line catches a set plus one or two pairs.
It clears one bit from the pairs field if needed when setting `k`
(since AAAKKQQ ranks the same as AAAKKQJ)
*/
else if(value=odds&odds-1){
value/=2;
kicker=(odds/2)^value;
return 6<<28|compress(value)<<13|compress(kicker);
}
else if (evens&&odds) {
result=6;
value=odds/2;
temp = evens&evens-1;
kicker= (temp)?temp:evens;
return 6<<28|compress(value)<<13|compress(kicker);
}
/* All the other hands fall here.
`h[3]` is in `k`, it will be used to detect straights.
(it holds a bit for each unique value and a bit for each unique suit)
*/
else{
/* Look for flushes.
remember that for suit X=1,2,4,8: h[X&7] holds a 3-bit card count,
starting at bit 0,1,2,3 respectively
subtract 1 from the count, store in `C`
If C>4, we have a 5 card flush. `t` is 5.
overwrite `k` with the flush suit, since a plain straight won't beat this, but a
straight flush will.
*/
if ((count=(h[0]>>3)&7)>4) { kicker=h[0]; result=5;}
else if ((count=h[1]&7)>4) { kicker=h[1]; result=5;}
else if ((count=(h[2]>>1)&7)>4) { kicker=h[2]; result=5;}
else if ((count=(h[4]>>2)&7)>4) { kicker=h[4]; result=5;}
/* for (i=0;i<4;i++){
int idx = (1<<i)&7;
count = h[idx]>>i;
count &= 7;
if(count>=5){
kicker=h[idx];
result=5;
break;
}
}
*/
// printf("#%d %08x %08x %d\n",C,k,h[X&7],X);
// printf("#%d %08x %d %d\n",C,k,X,i);
/* Now the straight detector.
clear the suit bits from a, then copy down the high bit (ace)
to the ones position so we can catch 5-high straights.
*/
kicker&=-64;
value=kicker|(kicker>>26)&16;
/* The next line zeros value unless there are at least 5 cards in a row.
`t` will be 4 for straights, 9 for straight flushes.
For a 6 or 7 card straight, there will be multiple consecutive bits set in value:
`value&=~(value/4)` clears all but the highest.
*/
value&=value*4;
value&=value*4;
value&=value*4;
value&=value*4;
if(value){
result+=4;
value&=~(value/4);
return result<<28|compress(value)<<13|0;
}
//k^value has 0 bits, i does not matter
/* finish up the pure flush processing: 't' is only set for flush,
store the high 5 cards in `k` and `value`,
by clearing low bit until the card count `C` is 5.
(done after straight detection to avoid calling AK98765 in same suit a plain flush.)
((i will be 0 for cases below here))
*/
// else if(i=t){for(i=(h[v&7]&63)/v;i-->5;)k&=k-1;v=k;} //k^v has 0 bits, i does not matter
else if (i=result){
while(count-->5){
kicker&=kicker-1; //k^v has 0 bits, i does not matter
}
return result<<28|compress(kicker)<<13; //|0
}
/* three of a kind:
two sets are a full house, caught above. so if there is any bit left in 'odds',
it is a set. v=o/2 shifts the value bit into the right place
*/
else if(value=odds/2) {
result=3; //v has 1 bit, k^v has 4 bits, i is 0 so we can clear 2
kicker^=value;
kicker&=kicker-1;
kicker&=kicker-1;
return 3<<28|compress(value)<<13|compress(kicker);
}
/* Pairs: a bit set in evens is a pair. we might have 1,2, or 3 of them.
`o` will be set if there is more than one, `i` will be set if there are 3.
`v` is set to the top 1 or 2 cards. 't' is 1 or 2.
*/
else if (evens){
temp=evens&evens-1;
if (temp&temp-1){
kicker^=temp;
kicker&=kicker-1;
return 2<<28|compress(temp)<<13|compress(kicker);
}
else{
kicker^=evens;
kicker&=kicker-1;
kicker&=kicker-1;
return 1+(temp>0)<<28|compress(evens)<<13|compress(kicker);
}
}
/* for all hands except 4 of a kind and full house,
we have left the primary cards which determine the hand's type in 'value'
and `a` holds all the cards (except a == v for flushes and straights)
set k to the kickers by findig all in a not in v (a^v)
then clear the extra 2. (or 1 if i is non zero b/c there was a 3rd pair).
*/
// printf("#%08x %08x %08x %d\n",value,k,k^value,i);
}
/*
build the final result.
4 bits for the type 0..9, 13 bits for the value cards, 13 for the kicker.
*/
kicker&=kicker-1;
kicker&=kicker-1;
return 0<<28|0<<13|compress(kicker);
}