-
Notifications
You must be signed in to change notification settings - Fork 0
/
deck.c
343 lines (268 loc) · 6.03 KB
/
deck.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
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
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
#include <stdlib.h>
#include "nou.h"
#include "deck.h"
#include "players.h"
Direction dir = DIRECTION;
Deckr deckr = {
.deck = NULL,
.n = 0,
.cards = 0,
.playing = 0,
.played = 0
};
//Deck* deck = NULL;
Card* top = NULL;
Card* stacktop = NULL, * stackbase = NULL;
Card* decktop = NULL, * deckbase = NULL;
Suit csuit = NOSUIT;
uint acc = 0;
uint seed, reseed;
static Player** playerringbuf;
static uint find_vacanti (uint* playing, uint* playeroff) {
Deck* deck = deckr.deck;
uint cards = deckr.cards;
Card* card = NULL;
Player* owner = NULL;
uint _playing = *playing;
uint playeri = 0;
uint lvacant_i = -1u;
for (uint _ = 0; _ < cards; _++) {
card = &index (deck, _, cards);
owner = card->owner;
if (!owner) {
lvacant_i = _;
break;
}
else {
_playing--;
playeri = (card->owner - player);
playeroff[playeri]++;
}
}
*playing = _playing;
return lvacant_i;
}
#define MARKVACANT(x,y) (!(x) && !(y))
static void sort_deck (uint i, uint* playing, uint* playeroff) {
Deck* deck = deckr.deck;
uint cards = deckr.cards;
Card* vacant = NULL, *card = NULL, tmp;
Player* owner;
uint _playing = *playing;
uint playeri = 0;
for (; i < cards; i++) {
card = &index (deck, i, cards);
owner = card->owner;
// found a vacant card: mark it
if (MARKVACANT (owner, vacant)) {
vacant = card;
}
// found an owned card: ...
else if (owner) {
_playing--;
// ... if there is a vacant card before it, recompute the index then swap ...
if (vacant) {
playeri = (owner - player);
owner->cards[playeroff[playeri]] = (vacant - deckbase);
playeroff[playeri]++;
tmp = *card;
*card = *vacant;
*vacant = tmp;
if (vacant != decktop && !(vacant+1)->owner) {
vacant++;
}
else {
vacant = NULL;
}
}
// ... otherwise, save the index as normal
else {
playeri = (card->owner - player);
owner->cards[playeroff[playeri]] = (card - deckbase);
playeroff[playeri]++;
}
}
// short-circuit
else if (! _playing) {
break;
}
}
*playing = _playing;
}
int sort (void) {
Deck* deck = deckr.deck;
uint cards = deckr.cards, playing = deckr.playing;
uint playeroff[playern];
uint lvacant_i = -1u;
uint stackbase_i = (cards - 1);
for (uint _ = 0; _ < playern; _++) {
playeroff[_] = 0;
}
lvacant_i = find_vacanti (&playing, (uint*)playeroff);
// there are no vacant cards left
if (lvacant_i == -1u) {
return NOCARDS;
}
sort_deck (lvacant_i, &playing, (uint*)playeroff);
// NOTE: this assumes the last index is vacant
while (!index (deck, stackbase_i, cards).owner) {
stackbase_i--;
}
stackbase = (deckbase + stackbase_i) + 1;
// account for the increment in `take_from_stack'
stacktop = stackbase - 1;
return 0;
}
void popdeck (Deckr* deckr) {
Card card;
Deck* deck = deckr->deck;
uint n = deckr->n;
uint i = 0, c = 0;
iter:
for (uint suitn = 1; suitn <= 4; suitn++)
for (Number number = _A; number <= _J; number++) {
card.suit = BIT (suitn);
card.number = number;
card.owner = NULL;
deck[i][c] = card;
c++;
}
card.suit = SPECIAL;
card.number = _B;
card.owner = NULL;
deck[i][c] = card;
c++;
card.suit = SPECIAL;
card.number = _C;
card.owner = NULL;
deck[i][c] = card;
c = 0;
i++;
if (i != n) {
goto iter;
}
};
uint reseeder (uint primr) {
uint _primr = primr;
reseeder_primr:
if (! primr) {
primr += (reseed ^ _primr);
primr++;
_primr++;
goto reseeder_primr;
}
else {
reseeder_seed:
if (! seed) {
seed ^= reseed;
seed++;
goto reseeder_seed;
}
}
uint div = primr < seed? (seed / primr): (primr / seed);
uint reseedbits = div % (sizeof reseed);
reseed <<= reseedbits;
reseed |= ONES (reseedbits);
return seed ^ reseed;
}
uint seeder (uint primr) {
uint _primr = primr;
seeder_primr:
if (! primr) {
primr += (reseed ^ _primr);
primr++;
_primr++;
goto seeder_primr;
}
else {
seeder_seed:
if (! seed) {
seed ^= reseed;
seed++;
goto seeder_seed;
}
}
uint div = primr < seed? (seed / primr): (primr / seed);
uint reseedbits = div % (sizeof reseed);
reseed |= seed;
reseed <<= reseedbits;
reseed ^= seed;
return reseeder (seed+reseed+1);
}
uint seeded (uint n) {
if (!n ) {
return n;
}
uint ret = 0;
seed = seeder (seed+reseed+1);
ret = (seed + reseed) % n;
reseeder (ret);
return ret;
}
static void swap (Deck* deck, uint i, uint cards, uint pcards) {
uint swp = (cards - pcards) + i;
uint _swp = seeded (cards - swp) + swp;
if (swp == _swp) {
return;
}
Card tmp = index (deck, swp, cards);
index (deck, swp, cards) = index (deck, _swp, cards);
index (deck, _swp, cards) = tmp;
}
void shuffle (Deckr* deckr, uint cards, uint pcards) {
Deck* deck = deckr->deck;
// loop through the playable cards
for (uint i = 0; i < pcards; i++) {
swap (deck, i, cards, pcards);
}
}
static void ringswap (Player** ring, uint i, uint botn) {
uint _i = seeded (botn - i) + i;
if (_i == i) {
return;
}
Player* tmp = ring[i];
ring[i] = ring[_i];
ring[_i] = tmp;
}
static inline void ringshuffle (Player** ring, uint botn) {
for (uint i = 0; i < botn; i++) {
ringswap (ring, i, botn);
}
}
static void allocplayers (uint botn) {
Player* bot;
player = &playerbuf[0];
player->tag = PLAYER;
player->cards = malloc (CARDN * sizeof (uint));
player->cardn = CARDN;
player->cardi = 0;
for (uint i = 1; i < botn; i++) {
bot = &playerbuf[i];
bot_init (i);
bot->tag = BOT;
bot->cards = malloc (CARDN * sizeof (uint));
bot->cardn = CARDN;
bot->cardi = 0;
}
}
static void drawcards (uint botn, uint cardn) {
for (uint cn = 0; cn < CPPLAYER; cn++) {
ringshuffle (playerringbuf, botn);
for (uint i = 0; i < botn; i++) {
(void) take (playerringbuf[i], 1, ALWAYS);
}
}
}
void popplayers (Deckr* deckr, uint botn, uint cardn) {
playerbuf = malloc (botn * sizeof (Player));
legalbuf = malloc ((botn - 1) * sizeof (Legal*));
playerringbuf = malloc (botn * sizeof (Player*));
for (uint i = 0; i < botn; i++) {
playerringbuf[i] = &playerbuf[i];
}
stackbase = deckbase;
allocplayers (botn);
drawcards (botn, cardn);
free (playerringbuf);
}