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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <tak.h>
int generate;
uint64_t heights[16];
float max_flats, outcome_black;
FILE *training_fh = NULL;
const int max_depth = 8;
static void
write_input(void) {
// Two numbers for flats remaining
fprintf(training_fh,"%.8f,%.8f,",
(float)(white_count & 127)/max_flats,
(float)(black_count & 127)/max_flats);
// Write the board layers
float val;
for (uint8_t depth = 0; depth < max_depth; depth++) {
for (uint8_t k = 0; k < board_size * board_size; k++) {
val = 0;
if (COUNT_AT(k)>depth) {
if (depth == 0) {
// Top layer of stacks is handled differently to indicate
// stone type
if (STONE_AT(k) == STONE_STANDING) {
val = (colours[k] & 1) ? +0.25 : -0.25;
} else if (STONE_AT(k) == STONE_CAPSTONE) {
val = (colours[k] & 1) ? +1.00 : -1.00;
} else {
val = (colours[k] & 1) ? +0.50 : -0.50;
}
} else {
// Layers underneath
val = (colours[k] & (1<<depth)) ? +0.50 : -0.50;
}
}
fprintf(training_fh,"%.2f,", val);
}
}
}
// Warning: performs _no_ checks on input whatsoever
static enum E_RESULT
parse_line(const char *pt, const ssize_t read) {
ssize_t idx;
enum E_RESULT r;
int total_plies = 0;
for (idx=0;idx<read;idx++) {
if (pt[idx]==',') total_plies++;
}
for(idx=0;;) {
if (pt[idx] == 'P') {
// P [A-F][1-6] [CF]?,
idx+=2;
enum STONE_VARIANT stone;
const uint8_t col = pt[idx]-'A', row = pt[idx+1]-'1';
if (idx + 3 < read) {
switch (pt[idx+3]) {
case 'W': { stone = STONE_STANDING; break; }
case 'C': { stone = STONE_CAPSTONE; break; }
default: { stone = STONE_FLAT; break; }
}
} else {
stone = STONE_FLAT;
}
r = try_place(THE_COORDS(col,row), current_colour, stone);
if (r != ACT_OK) return r;
} else if (pt[idx] == 'M') {
// M [A-F][1-6] [A-F][1-6]( [1-6])+,
idx+=2;
uint8_t drops[board_size];
const uint8_t s_col =pt[idx]-'A', s_row=pt[idx+1]-'1',
d_col=pt[idx+3]-'A', d_row=pt[idx+4]-'1';
idx+=4;
enum MOVE_DIRECTION dir = M_RIGHT;
if (s_col < d_col) dir=M_RIGHT;
else if (s_col > d_col) dir=M_LEFT;
else if (s_row < d_row) dir=M_UP;
else if (s_row > d_row) dir=M_DOWN;
uint8_t steps = 0;
do {
idx+=2;
drops[steps++] = pt[idx] - '0';
} while (idx+2<read && pt[idx+1] != ',');
r = try_move(THE_COORDS(s_col, s_row), dir, steps, drops);
if (r != ACT_OK) return r;
if (generate == 0) {
// Measure height of stacks exceeding 1
for (int k = 0; k < board_size * board_size; k++) {
if (COUNT_AT(k)>1) heights[COUNT_AT(k)]+=1;
}
}
}
// Generate training data, not too early in the game
if (generate && ply + 5 > total_plies) {
write_input();
if (ply >= total_plies) {
if (outcome_black > 0.5) outcome_black = 1.0;
else outcome_black = 0.0;
}
fprintf(training_fh,"%.2f\n", outcome_black);
}
// Parse next action
while (idx<read && pt[idx++]!=',');
if (idx>=read) return ACT_OK;
next_ply();
}
return ACT_OK;
}
int
main(int argc, char **argv) {
(void)(argc);
enum E_RESULT r;
enum WIN_TYPE win;
uint32_t games = 0, overflow=0, illegal = 0;
uint32_t road_wins=0, flat_wins=0, road_turns=0, flat_turns=0,
white_wins = 0, black_wins = 0;
for (int k = 0; k < 16; k++) heights[k] = 0;
size_t len = 0;
ssize_t read = 0;
FILE *playtak_fh = NULL;
char *line = NULL, td_fn[65];
const uint8_t size = argv[1][0]-'0';
playtak_fh = fopen(argv[2], "r");
if (playtak_fh == NULL) exit(EXIT_FAILURE);
if (argc > 3 && (!strncmp("generate", argv[3], 8))) {
generate=1;
max_flats = (size == 5) ? 21.0 : 30.0;
snprintf(td_fn, 64, "data/training-%d.csv",size);
training_fh = fopen(td_fn, "w");
if (training_fh == NULL) exit(EXIT_FAILURE);
// Write header
fputs("\"White flats\",\"Black flats\",",training_fh);
for (int depth = 0; depth < max_depth; depth++) {
for (int k = 0; k < size*size; k++) {
fprintf(training_fh,"\"Stack %d %d\",",depth,k);
}
}
fputs("\"Outcome\"\n",training_fh);
} else generate=0;
while ((read = getline(&line, &len, playtak_fh)) != -1) {
// Reset everything
reset_state(size);
// Store the outcome of this game. Black win = 1
if (line[read-4] == '0') outcome_black = 0.99;
else outcome_black = 0.01;
// Parse the line
r = parse_line(line,read-4);
// Adjust counts if we're not generating training data
if (generate == 0) {
if (r == ACT_ILLEGAL) {
illegal++;
printf("Illegal:\n%s",line);
} else if (r == ACT_OVERFLOW) {
printf("Overflow:\n%s",line);
overflow++;
} else {
win = check_win();
if (win == WIN_FLAT_BLACK
|| win == WIN_FLAT_WHITE
|| win == WIN_DRAW) {
flat_wins++;
flat_turns += ply/2+1;
} else {
road_wins++;
road_turns += ply/2+1;
}
if (win == WIN_FLAT_BLACK || win == WIN_ROAD_BLACK)
black_wins++;
else if (win == WIN_FLAT_WHITE || win == WIN_ROAD_WHITE)
white_wins++;
}
}
games++;
}
fclose(playtak_fh);
if (generate) fclose(training_fh);
if (line) free(line);
if (illegal || overflow) putchar('\n');
printf("Read %d games\n",games);
if (generate==0) {
printf("Illegals: %d\nOverflows: %d\n\
Black wins: %.3f%%\n\
Road wins: %d\nFlat wins: %d\n\
Average turns to road win: %.3f\n\
Average turns to flat win: %f\n",
illegal, overflow,
(double)black_wins / (double)(black_wins+white_wins) * 100,
road_wins, flat_wins,
(double)(road_turns)/(double)(road_wins),
(double)(flat_turns)/(double)(flat_wins));
for (int k = 2; k < 16; k++) {
printf("Height %2d: %7ld\n",k,heights[k]);
}
}
exit(EXIT_SUCCESS);
}
|
