-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathstate_utils.xc
More file actions
434 lines (402 loc) · 12 KB
/
Copy pathstate_utils.xc
File metadata and controls
434 lines (402 loc) · 12 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
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
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
#include <state.xh>
#include <colors.h>
#include <stdbool.h>
#include <assert.h>
Lot ?incLot(Lot ?l, PlayerId p, arena_t ar) {
allocate_using arena ar;
match (l) {
?&[h | t] -> {
if (p == 0) {
assert(value(h) < NUM_PIECES);
return cons(new var(value(h) + 1), t, ar);
} else {
return cons(h, incLot(t, p - 1, ar), ar);
}
}
?&[] -> {
assert(false);
}
}
}
Lot ?decLot(Lot ?l, PlayerId p, arena_t ar) {
allocate_using arena ar;
match (l) {
?&[h | t] -> {
if (p == 0) {
assert(value(h) > 0);
return cons(new var(value(h) - 1), t, ar);
} else {
return cons(h, decLot(t, p - 1, ar), ar);
}
}
?&[] -> {
assert(false);
}
}
}
list<Move ?> ?getActionMoves(Action a) {
allocate_using heap;
static list<Move ?> ?noMoves;
if (!(void*)noMoves) noMoves = newlist<Move ?>[];
return match (a) (Play(_, m) -> m; Burn(_) -> noMoves;);
}
string center(unsigned pad, string s, arena_t ar) {
allocate_using arena ar;
return str(" ") * ((pad + 1) / 2) + s + str(" ") * (pad / 2);
}
template<typename a>
string wrapPlayerEffectForeground(PlayerId p, a s, arena_t ar) {
allocate_using arena ar;
string pre;
if (p % 16 < 8) {
pre = EFFECT(FOREGROUND(p % 8));
} else {
pre = EFFECT(LIGHT_FOREGROUND(p % 8)) + EFFECT(ITALIC);
}
string post = EFFECT(FOREGROUND(DEFAULT)) + EFFECT(ITALIC_OFF);
return pre + str(s) + post;
}
template<typename a>
string wrapPlayerEffectBackground(PlayerId p, a s, arena_t ar) {
allocate_using arena ar;
string pre;
if (p % 16 < 8) {
pre = EFFECT(BACKGROUND(p % 8));
} else {
pre = EFFECT(LIGHT_BACKGROUND(p % 8));
}
string post = EFFECT(BACKGROUND(DEFAULT));
return pre + str(s) + post;
}
string showPlayerId(PlayerId p, arena_t ar) {
allocate_using arena ar;
return wrapPlayerEffectForeground(p, str("Player ") + p, ar);
}
size_t showPositionMaxLen(Position p) {
return 10;
}
size_t showPosition(char buf[], Position p) {
return match (p)
(Out(?&n) -> sprintf(buf, "%u", n);
Finish(?&p, ?&n) -> sprintf(buf, "F%u%u", p, n););
}
string showStatePosition(State s, Position pos, arena_t ar) {
allocate_using arena ar;
string res = show(pos);
match (s) {
St(?&numPlayers, _, board, _) -> {
if (mapContains(board, pos)) {
PlayerId p = mapGet(board, pos);
return center(
3 - res.length,
EFFECT(UNDERLINE) + wrapPlayerEffectForeground(p, res, ar) + EFFECT(UNDERLINE_OFF),
ar);
} else {
return center(3 - res.length, res, ar);
}
}
}
}
string showState(State s, arena_t ar) {
allocate_using arena ar;
string rows[8];
for (unsigned i = 0; i < 8; i++) {
rows[i] = str("");
}
match (s) {
St(?&numPlayers, ?&partners, board, lot) -> {
for (PlayerId p = 0; p < numPlayers; p++) {
rows[0] = " " + rows[0];
rows[7] =
wrapPlayerEffectBackground(p, showStatePosition(s, Out(new var(p * SECTOR_SIZE)), ar), ar) + " " +
rows[7];
for (unsigned i = 1; i < 8; i++) {
rows[7 - i] = showStatePosition(s, Out(new var(i + p * SECTOR_SIZE)), ar) + " " + rows[7 - i];
}
rows[0] = " " + rows[0];
for (unsigned i = 0; i < 7; i++) {
rows[i + 1] = showStatePosition(s, Out(new var(i + 8 + p * SECTOR_SIZE)), ar) + " " + rows[i + 1];
}
unsigned lotCount = value(nthList(lot, (p + 1) % numPlayers));
rows[0] =
" " +
EFFECT(INVERSE) +
wrapPlayerEffectForeground(
(p + 1) % numPlayers,
str(lotCount > 3? "◯" : "⬤") + " " +
str(lotCount > 2? "◯" : "⬤") + " ",
ar) +
EFFECT(INVERSE_OFF) +
" " + rows[0];
rows[1] =
" " +
EFFECT(INVERSE) +
wrapPlayerEffectForeground(
(p + 1) % numPlayers,
str(lotCount > 1? "◯" : "⬤") + " " +
str(lotCount > 0? "◯" : "⬤") + " ",
ar) +
EFFECT(INVERSE_OFF) +
" " + rows[1];
assert(lotCount <= 4);
rows[2] = " " + rows[2];
for (unsigned i = 0; i < NUM_PIECES; i++) {
rows[6 - i] =
" " +
wrapPlayerEffectBackground(
(p + 1) % numPlayers,
showStatePosition(s, Finish(new var((p + 1) % numPlayers), new var(i)), ar),
ar) +
" " + rows[6 - i];
}
rows[7] =
showStatePosition(s, Out(new var(17 + p * SECTOR_SIZE)), ar) + " " +
showStatePosition(s, Out(new var(16 + p * SECTOR_SIZE)), ar) + " " +
showStatePosition(s, Out(new var(15 + p * SECTOR_SIZE)), ar) + " " +
rows[7];
}
}
}
string result = "";
for (unsigned i = 0; i < 8; i++) {
result += rows[i] + "\n";
}
return result;
}
unsigned ?copyUnsignedVar(unsigned ?v, arena_t ar) {
allocate_using arena ar;
return new var(value(v));
}
State copyState(State s, arena_t ar) {
allocate_using arena ar;
return match (s)
(St(?&numPlayers, ?&partners, board, lot) ->
St(
new var(numPlayers), new var(partners),
copyMap(board, copyPosition, NULL, ar),
copyList(lot, copyUnsignedVar, ar));
);
}
string showMove(Move m, PlayerId p1, PlayerId p2, arena_t ar) {
allocate_using arena ar;
return match (m)
(MoveOut(?&p) @when (p == p1) -> str("move out");
MoveOut(?&p) @when (p == p2) -> str("move partner out");
MoveOut(?&p) -> str("move Player ") + p + " out";
MoveDirect(f, t) -> show(f) + " → " + show(t);
Swap(a, b) -> "swap " + show(a) + " with " + show(b););
}
string showMoves(list<Move ?> ?ms, PlayerId p1, PlayerId p2, arena_t ar) {
allocate_using arena ar;
return match (ms)
(?&[?&h | t@?&[_ | _]] -> showMove(h, p1, p2, ar) + ", " + showMoves(t, p1, p2, ar);
?&[?&h] -> showMove(h, p1, p2, ar);
?&[] -> str(""););
}
string showAction(Action a, PlayerId p1, PlayerId p2, arena_t ar) {
allocate_using arena ar;
return match (a)
(Play(c, ?&[]) -> str("play ") + c;
Play(c, ms) -> str("play ") + c + ", " + showMoves(ms, p1, p2, ar);
Burn(c) -> str("burn ") + c;);
}
string showActions(vector<Action> a, PlayerId p1, PlayerId p2, arena_t ar) {
allocate_using arena ar;
string result = "";
for (unsigned i = 0; i < a.size; i++) {
result += str(i) + ": " + showAction(a[i], p1, p2, ar) + "\n";
}
return result;
}
size_t showHandMaxLen(const Hand h) {
size_t len = 0;
for (Card c = 0; c < CARD_MAX; c++) {
size_t cardStrLen = match (c) (
Joker -> 5;
10 -> 2;
_ -> 1;
);
len += h[c] * (cardStrLen + 1);
}
return len;
}
size_t showHand(char buf[], const Hand h) {
size_t len = 0;
for (Card c = 0; c < CARD_MAX; c++) {
len += buildStr(buf + len, (str(c) + " ") * h[c]);
}
return len;
}
Json jsonState(State s, arena_t ar) {
allocate_using arena ar;
match (s) {
St(?&numPlayers, ?&partners, board, lot) -> {
vector<JsonItem> boardItems = {};
query mapContainsValue((board), Pos, P) {
allocate_using arena ar;
boardItems.append((JsonItem){show(Pos), JsonInteger(value(P))});
return false;
};
vector<Json> lotItems = new vector<Json>(numPlayers);
query nth((lot), P, N) {
lotItems[value(P)] = JsonInteger(value(N));
return false;
};
vector<JsonItem> items = {
{"numPlayers", JsonInteger(numPlayers)},
{"partners", JsonBool(partners)},
{"board", JsonObject(boardItems)},
{"lot", JsonArray(lotItems)}
};
return JsonObject(items);
}
}
}
Json jsonHands(unsigned numPlayers, const Hand hands[numPlayers], arena_t ar) {
allocate_using arena ar;
vector<Json> items = {};
for (unsigned i = 0; i < numPlayers; i++) {
items.append(JsonString(show(hands[i])));
}
return JsonArray(items);
}
Json jsonActions(vector<Action> a, PlayerId p1, PlayerId p2, arena_t ar) {
allocate_using arena ar;
vector<Json> items = {};
for (unsigned i = 0; i < a.size; i++) {
items.append(JsonString(showAction(a[i], p1, p2, ar)));
}
return JsonArray(items);
}
void initializeDeck(Hand h) {
h[Joker] = 4;
for (Card c = A; c < CARD_MAX; c++) {
h[c] = 8;
}
}
unsigned getDeckSize(const Hand deck) {
unsigned result = 0;
for (Card c = Joker; c < CARD_MAX; c++) {
result += deck[c];
}
return result;
}
unsigned deal(unsigned min, unsigned max, Hand deck, unsigned numPlayers, Hand hands[numPlayers]) {
unsigned deckSize = getDeckSize(deck);
memset(hands, 0, sizeof(Hand) * numPlayers);
unsigned handSize;
for (handSize = 0; handSize < max && deckSize >= numPlayers; handSize++) {
for (PlayerId p = 0; p < numPlayers; p++) {
int n = rand() % deckSize;
Card dealt;
for (Card c = Joker; c < CARD_MAX; c++) {
n -= deck[c];
if (n < 0) {
dealt = c;
break;
}
}
assert(n < 0);
assert(deck[dealt] > 0);
hands[p][dealt]++;
deck[dealt]--;
deckSize--;
}
}
return handSize;
}
Position copyPosition(Position p, arena_t ar) {
allocate_using arena ar;
return match (p)
(Out(?&i) -> Out(new var(i));
Finish(?&p, ?&i) -> Finish(new var(p), new var(i)););
}
Move copyMove(Move m, arena_t ar) {
allocate_using arena ar;
return match (m)
(MoveOut(?&p) -> MoveOut(new var(p));
MoveDirect(?&from, ?&to) ->
MoveDirect(new var(copyPosition(from, ar)), new var(copyPosition(to, ar)));
Swap(?&a, ?&b) -> Swap(new var(copyPosition(a, ar)), new var(copyPosition(b, ar))););
}
list<Move ?> ?copyMoves(list<Move ?> ?ms, arena_t ar) {
allocate_using arena ar;
return match (ms)
(?&[?&h | t] -> cons(new var(copyMove(h, ar)), copyMoves(t, ar), ar);
?&[] -> nil<Move ?>(ar););
}
State initialState(unsigned numPlayers, bool partners, arena_t ar) {
allocate_using arena ar;
return St(
new var(numPlayers),
new var(partners),
emptyMap<Position, PlayerId, comparePosition>(ar),
replicateList(numPlayers, new var(NUM_PIECES), ar));
}
State applyMove(Move m, State s, arena_t ar) {
allocate_using arena ar;
match (s, m) {
St(n, ps, board, lot), MoveOut(?&p) -> {
assert(mapContains(lot, p));
assert(mapGet(lot, p) > 0);
Position dest = Out(new var(p * SECTOR_SIZE));
Board ?newBoard = mapInsert(board, dest, p, ar);
Lot ?newLot = decLot(lot, p, ar);
if (mapContains(board, dest)) {
PlayerId destPlayer = mapGet(board, dest);
return St(n, ps, newBoard, incLot(newLot, destPlayer, ar));
} else {
return St(n, ps, newBoard, newLot);
}
}
St(n, ps, board, lot), MoveDirect(?&f, ?&t) -> {
assert(comparePosition(f, t) != 0);
assert(mapContains(board, f));
PlayerId p = mapGet(board, f);
Board ?newBoard = mapInsert(mapDelete(board, f, ar), copyPosition(t, ar), p, ar);
if (mapContains(board, t)) {
PlayerId destPlayer = mapGet(board, t);
return St(n, ps, newBoard, incLot(lot, destPlayer, ar));
} else {
return St(n, ps, newBoard, lot);
}
}
St(n, ps, board, lot), Swap(?&a, ?&b) -> {
assert(comparePosition(a, b) != 0);
assert(mapContains(board, a));
assert(mapContains(board, b));
PlayerId p1 = mapGet(board, a);
PlayerId p2 = mapGet(board, b);
return St(n, ps, mapInsert(mapInsert(board, copyPosition(a, ar), p2, ar), copyPosition(b, ar), p1, ar), lot);
}
}
}
State applyMoves(list<Move ?> ?ms, State s, arena_t ar) {
return match (ms)
(?&[?&h | t] -> applyMoves(t, applyMove(h, s, ar), ar);
?&[] -> s;);
}
State applyAction(Action a, State s, Hand h, Hand discard, arena_t ar) {
match (a) {
Play(c, ms) -> {
if (h) {
assert(h[c] > 0);
h[c]--;
}
if (discard) {
discard[c]++;
}
return applyMoves(ms, s, ar);
}
Burn(c) -> {
if (h) {
assert(h[c] > 0);
h[c]--;
}
if (discard) {
discard[c]++;
}
return s;
}
}
}