aboutsummaryrefslogtreecommitdiff
path: root/include/weights.h
AgeCommit message (Collapse)Author
45 hoursswitch to explicit game state & important bug fix & clang formattslil clingman
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.
45 hoursnew neural network arch (faster + better) & minor changes + fixestslil clingman
Gone is the convolutional neural network, for it turns out not only is it more difficult to train, but all of the extra information about board layers didn't make much of a difference at this size. So cnn1986 has been replaced by nn1986, a standard, two-layer, dense nn configured as a binary classifier and (mis)used in that capacity. Note: total number of parameters is unchanged. HARK: this new nn exposes a bug somewhere in ctak. Run ctlm with self-play to see the completely borked board state at the end.
45 hoursWelcome geminict!tslil clingman
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.
45 hoursFix copyright notice in files, and small preemptive optimisationtslil clingman
Eventually there'll be a more complicated data generation step than the one we're presently using, so having it in-lined in the loop is wasteful. Ideally also this would be update per ply and we could avoid recalculating it entirely for every query -- though it's probably ``fast enough'' for now. Also, caching is WIP.
45 hoursRename ct_k -> ct, IANAL but ...tslil
45 hoursAdded license information!tslil clingman
45 hoursWent back up to 1986 weightstslil
45 hoursThere was a bug in the minimax!tslil
45 hoursWider?tslil
45 hoursone output (of course), Pade approximant of logistic for activationtslil
45 hoursThis finally works!tslil
45 hoursClose in principle, but there;s a bug in ct1997 &/ pptdb!tslil
45 hoursThis is the general idea, but i'm sure order is incorrect somewheretslil
45 hoursStarting on importing network!tslil