forked from nneonneo/2048-ai
-
Notifications
You must be signed in to change notification settings - Fork 0
/
2048.h
57 lines (47 loc) · 1.57 KB
/
2048.h
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
#include <stdlib.h>
#include "platdefs.h"
/* The fundamental trick: the 4x4 board is represented as a 64-bit word,
* with each board square packed into a single 4-bit nibble.
*
* The maximum possible board value that can be supported is 32768 (2^15), but
* this is a minor limitation as achieving 65536 is highly unlikely under normal circumstances.
*
* The space and computation savings from using this representation should be significant.
*
* The nibble shift can be computed as (r,c) -> shift (4*r + c). That is, (0,0) is the LSB.
*/
typedef uint64_t board_t;
typedef uint16_t row_t;
static const board_t ROW_MASK = 0xFFFFULL;
static const board_t COL_MASK = 0x000F000F000F000FULL;
static inline void print_board(board_t board) {
int i,j;
for(i=0; i<4; i++) {
for(j=0; j<4; j++) {
printf("%c", "0123456789abcdef"[(board)&0xf]);
board >>= 4;
}
printf("\n");
}
printf("\n");
}
static inline board_t unpack_col(row_t row) {
board_t tmp = row;
return (tmp | (tmp << 12ULL) | (tmp << 24ULL) | (tmp << 36ULL)) & COL_MASK;
}
static inline row_t reverse_row(row_t row) {
return (row >> 12) | ((row >> 4) & 0x00F0) | ((row << 4) & 0x0F00) | (row << 12);
}
/* Functions */
#ifdef __cplusplus
extern "C" {
#endif
DLL_PUBLIC void init_tables();
typedef int (*get_move_func_t)(board_t);
DLL_PUBLIC float score_toplevel_move(board_t board, int move);
DLL_PUBLIC int find_best_move(board_t board);
DLL_PUBLIC int ask_for_move(board_t board);
DLL_PUBLIC void play_game(get_move_func_t get_move);
#ifdef __cplusplus
}
#endif