aboutsummaryrefslogtreecommitdiff
path: root/include/pv.c
diff options
context:
space:
mode:
authortslil <tslil@posteo.de>2026-09-10 14:12:41 +0100
committertslil <tslil@posteo.de>2026-09-10 21:04:40 +0100
commit220a4b79e4b6d742a9ca7c278a1962b870500fbc (patch)
treeba527c7ec1feac91c5d59772c05fe9d32af6bdb8 /include/pv.c
parent710d5a5225edb44d171ca9ac6345e9a61aa4f125 (diff)
credit Mitchell Riley: we can drop 65 parameters for about the same strength; also train for longer
The idea is that the current model is M_theta(board, ply) = "score for player 0", but we can instead create a different model M'_theta(board) = "score for player 0 assuming that it's player 0's move" and for a certain pair of functions sigma, normalise, recover M_theta(board, ply) = sigma(ply) M'_theta(normalise(board, ply)). This pair of functions is sigma(ply) = +/- 1 (parity), and normalise being a conditional interchange of pieces on the board depending on the parity of the ply. The only things stopping this from being completely straightforward is that nn_train.py evaluates M'_theta itself so we need to pass sigma(ply) to the training loop. 6x6 is still untrained.
Diffstat (limited to 'include/pv.c')
-rw-r--r--include/pv.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/include/pv.c b/include/pv.c
index 94c00d1..fb5f181 100644
--- a/include/pv.c
+++ b/include/pv.c
@@ -44,7 +44,7 @@ void pv_capture_leaf(pv_leaf_t *leaf, tak_state_p state,
nn_cell_idxs(leaf->cells, state);
for (uint8_t loc = n_cells; loc < PV_MAX_CELLS; loc++)
leaf->cells[loc] = 0;
- leaf->current_colour = (uint8_t)state->current_colour;
+ leaf->parity_sign = (state->ply & 1) ? 1.0f : -1.0f;
leaf->terminal = (uint8_t)(winner < 0xFF);
leaf->terminal_value = leaf->terminal ? terminal_value(winner) : 0.0f;
}