ctak/src/geminict.c, branch hybrid_rootstrapAn implementation of Tak and a computer opponent in Chttps://git.l-3.space/ctak/atom/src/geminict.c?h=hybrid_rootstrap2026-09-12T14:47:15Zflood fill for roads, fix dragon, memoise leaf eval, enable diagonal in nn_train.py2026-09-12T14:47:15Ztsliltslil@posteo.de2026-09-11T17:36:10Zurn:sha1:a361728f39812e25599323c52510c0eb3131bd90default engines to depth 4, add a rolling window to nn_train.py2026-09-02T18:43:12Ztsliltslil@posteo.de2026-09-02T11:21:20Zurn:sha1:f11793dc0fddfcaad04b89827634cbb40fa98e59
I've noticed high variability in training efficacy, part of that i think is due to the fact that the dataset per iteration is not really that large. Sure, it has many rows, but it's fundamentally given by the same engine playing itself with some entropy injection. To remedy this i've expanded the input data for any given iteration to contain --replay-iters many previous datasets as input too. Alongside that decreased the epsilon decay rate for slower "cooling", and included much more of the early game in the training set (min ply 8 -> 4).
might as well enable size 62023-01-21T21:00:57Ztslil clingmantslil@posteo.de2023-01-21T18:30:45Zurn:sha1:72c5056c5aa614d9a86f8b760955cfcf96c44be4
Same network architecture, same training principle. Predictably this is
too slow.
Also statically allocate state in driver programmes.
switch to explicit game state & important bug fix & clang format2023-01-16T11:25:47Ztslil clingmantslil@posteo.de2023-01-15T20:31:00Zurn:sha1:ef785da721a47e6d13aa854c795d2a9e269285b0
Previously the code base assumed that there was a single, global game
state which was the implicit target of all actions taken. Looking
ahead at architectural improvements, this has now been (almost
entirely) made explicit and functions take tak_state_p where
necessary (and also where unnecessary).
Two important fixes to actions.c were made:
- Previously when generating the possible stack moves, stack height
overflows (> 15) were not taken into account and this resulted in the
tree search corrupting the board state. Now action search does not
list all legal actions, rather the subset of these encodeable by the
implementation.
- The check for crushing on a stack move was incorrect (too strict),
and this resulted in many legitimate moves being igonored.
Finally, in other changes, weights have also been improved by training
all games instead of some subset for chosen players, and clang-format
was run on the codebase.
Went for more standard unicode symbols2021-10-06T13:46:13Ztslil clingmantslil@posteo.de2021-10-06T13:46:13Zurn:sha1:3dd2bf6b5a2a102f257bd7822c3a95db20ea317cCorrected win screen in geminict2021-10-06T13:26:04Ztslil clingmantslil@posteo.de2021-10-06T13:26:04Zurn:sha1:90658a0c3fa9353f6e9e0f36761f4c28b2858c2cEnforce quoted ptn string for geminict2021-10-06T12:50:27Ztslil clingmantslil@posteo.de2021-10-06T12:50:27Zurn:sha1:9c24621233c22de6ffd3ddcfe68f0b48601d27fdWelcome geminict!2021-10-05T22:23:32Ztslil clingmantslil@posteo.de2021-10-05T22:22:23Zurn:sha1:c9fa20b590de94a9ddb408e277065a117b16570b
This is a special interface to negamax_cnn1986 which is designed to
generate output for use in a CGI tak interface to be used over gemini.
Also in this commit is a reformating of the various source files to
use the traditional tab width of 8 spaces.