#include #include #include #include float max_flats; uint64_t heights[16]; int result, generate; FILE *training_fh = NULL; const int max_depth = 8; static void write_input(void) { // Whose turn is it? /* fprintf(training_fh,"%d,",current_colour == C_BLACK); */ // Two numbers for flats remaining fprintf(training_fh,"%.8f,%.8f,", (float)(white_count & 127)/max_flats, (float)(black_count & 127)/max_flats); // Top layer of stacks is handled differently to indicate stone type float val; uint16_t mask = 1; for (int k = 0; k < board_size * board_size; k++) { val = 0; if (COUNT_AT(k)>0) { if (STONE_AT(k) == STONE_STANDING) { val = (colours[k] & mask) ? +0.25 : -0.25; } else if (STONE_AT(k) == STONE_CAPSTONE) { val = (colours[k] & mask) ? +1.00 : -1.00; } else { val = (colours[k] & mask) ? +0.50 : -0.50; } } fprintf(training_fh,"%.2f,", val); } // Layers underneath for (int depth = 1; depth < max_depth; depth++) { mask <<= 1; for (int k = 0; k < board_size * board_size; k++) { val = 0; if (COUNT_AT(k)>depth) val = (colours[k] & mask) ? +0.50 : -0.50; fprintf(training_fh,"%.2f,", val); } } /* * float t; * for (int k = 0; k < board_size * board_size; k++) { * // stacks encoded as balanced ternary * const int h = COUNT_AT(k); * t = 0; * mask = 1<>=1; * } * fprintf(training_fh,"%.8f,",2*t); * } */ } // Warning: performs _no_ checks on input whatsoever static enum E_RESULT parse_line(const char *pt, const ssize_t read) { ssize_t idx = 0; enum E_RESULT r; for(;;) { 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; char buf[20]; generate_place(board_size, THE_COORDS(col,row), stone, buf); puts(buf); } 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+21) heights[COUNT_AT(k)]+=1; } } char buf[20]; generate_move(board_size, THE_COORDS(s_col, s_row), dir, steps, drops, buf); puts(buf); } if (current_colour == C_BLACK && ply > 15) puts("Here"); // Generate training data, not too early in the game if (generate && current_colour == C_BLACK && ply > 15) { write_input(); fprintf(training_fh,"%d,%d\n", result, 1-result); } // Parse next action while (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("\"White win\",\"Black win\"\n",training_fh); } else generate=0; while ((read = getline(&line, &len, playtak_fh)) != -1) { // Reset everything reset_state(size); // Store the result of this game if (line[read-4] == '0') result = 0; else result = 1; // 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); }