Repository navigation
Expand file tree
/
Copy pathengine.cpp
More file actions
183 lines (144 loc) · 5.37 KB
/
Copy pathengine.cpp
File metadata and controls
183 lines (144 loc) · 5.37 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
#include <pybind11/pybind11.h>
#include <pybind11/numpy.h>
#include <algorithm>
#include <cstdint>
typedef uint64_t board_t;
board_t row_left_table[65536];
board_t row_right_table[65536];
void init_tables() {
for (unsigned row = 0; row < 65536; ++row) {
int line[4];
line[0] = (row >> 0) & 0xF;
line[1] = (row >> 4) & 0xF;
line[2] = (row >> 8) & 0xF;
line[3] = (row >> 12) & 0xF;
// --- Simulate Left Move ---
int new_line_left[4] = {0};
int write_idx_l = 0;
int last_val_l = 0;
for (int i = 0; i < 4; ++i) {
if (line[i] == 0) continue;
if (last_val_l == 0) {
last_val_l = line[i];
} else if (last_val_l == line[i]) {
new_line_left[write_idx_l++] = last_val_l + 1;
last_val_l = 0;
} else {
new_line_left[write_idx_l++] = last_val_l;
last_val_l = line[i];
}
}
if (last_val_l != 0) new_line_left[write_idx_l] = last_val_l;
row_left_table[row] = (new_line_left[0] << 0) | (new_line_left[1] << 4) |
(new_line_left[2] << 8) | (new_line_left[3] << 12);
// --- Simulate Right Move ---
int new_line_right[4] = {0};
int write_idx_r = 3;
int last_val_r = 0;
for (int i = 3; i >= 0; --i) {
if (line[i] == 0) continue;
if (last_val_r == 0) {
last_val_r = line[i];
} else if (last_val_r == line[i]) {
new_line_right[write_idx_r--] = last_val_r + 1;
last_val_r = 0;
} else {
new_line_right[write_idx_r--] = last_val_r;
last_val_r = line[i];
}
}
if (last_val_r != 0) new_line_right[write_idx_r] = last_val_r;
row_right_table[row] = (new_line_right[0] << 0) | (new_line_right[1] << 4) |
(new_line_right[2] << 8) | (new_line_right[3] << 12);
}
}
board_t move_left(board_t board) {
board_t res = 0;
res |= (board_t)row_left_table[(board >> 0) & 0xFFFF] << 0;
res |= (board_t)row_left_table[(board >> 16) & 0xFFFF] << 16;
res |= (board_t)row_left_table[(board >> 32) & 0xFFFF] << 32;
res |= (board_t)row_left_table[(board >> 48) & 0xFFFF] << 48;
return res;
}
board_t move_right(board_t board) {
board_t res = 0;
res |= (board_t)row_right_table[(board >> 0) & 0xFFFF] << 0;
res |= (board_t)row_right_table[(board >> 16) & 0xFFFF] << 16;
res |= (board_t)row_right_table[(board >> 32) & 0xFFFF] << 32;
res |= (board_t)row_right_table[(board >> 48) & 0xFFFF] << 48;
return res;
}
board_t transpose(board_t board) {
board_t result = 0;
for (int r = 0; r < 4; ++r) {
for (int c = 0; c < 4; ++c) {
board_t val = (board >> ((r * 4 + c) * 4)) & 0xF;
result |= (val << ((c * 4 + r) * 4));
}
}
return result;
}
board_t move_up(board_t board) {
board_t transposed = transpose(board);
board_t moved = move_left(transposed);
return transpose(moved);
}
board_t move_down(board_t board) {
board_t transposed = transpose(board);
board_t moved = move_right(transposed);
return transpose(moved);
}
namespace py = pybind11;
py::array_t<float> board_to_tensor(board_t board) {
// 1. Allocate a flat NumPy array of 256 floats
py::array_t<float> result(256);
py::buffer_info buf = result.request();
float* ptr = static_cast<float*>(buf.ptr);
// 2. Zero out the memory block (much faster in C++ than Python)
for (int i = 0; i < 256; ++i) {
ptr[i] = 0.0f;
}
// 3. Populate the one-hot values
for (int i = 0; i < 16; ++i) {
int power = (board >> (i * 4)) & 0xF;
// Cap the channel index at 15
int ch = (power == 0) ? 0 : std::min(power, 15);
// PyTorch expects shape (16, 4, 4), which flattens to: (channel * 16) + cell_index
ptr[ch * 16 + i] = 1.0f;
}
return result;
}
py::array_t<float> batch_boards_to_tensor(py::array_t<board_t> boards) {
py::buffer_info buf_in = boards.request();
board_t* ptr_in = static_cast<board_t*>(buf_in.ptr);
size_t N = buf_in.shape[0];
// Allocate a flat array for N boards * 256 floats
py::array_t<float> result(N * 256);
py::buffer_info buf_out = result.request();
float* ptr_out = static_cast<float*>(buf_out.ptr);
// Zero out memory instantly
std::memset(ptr_out, 0, N * 256 * sizeof(float));
// Populate the one-hot values for the entire batch
for (size_t b = 0; b < N; ++b) {
board_t board = ptr_in[b];
float* base = ptr_out + (b * 256);
for (int i = 0; i < 16; ++i) {
int power = (board >> (i * 4)) & 0xF;
int ch = (power == 0) ? 0 : std::min(power, 15);
base[ch * 16 + i] = 1.0f;
}
}
// Reshape it natively in C++ so PyTorch gets exactly [N, 16, 4, 4]
result.resize({(ssize_t)N, (ssize_t)16, (ssize_t)4, (ssize_t)4});
return result;
}
PYBIND11_MODULE(c2048, m) {
m.def("init_tables", &init_tables);
m.def("move_left", &move_left);
m.def("move_right", &move_right);
m.def("move_up", &move_up);
m.def("move_down", &move_down);
m.def("transpose", &transpose);
m.def("board_to_tensor", &board_to_tensor);
m.def("batch_boards_to_tensor", &batch_boards_to_tensor);
}