ctak - An implementation of Tak and a computer opponent in C

Age	Commit message (Collapse)	Author
41 hours	switch to returning an array of actions instead of a linked list	tslil clingman
	- attempts to keep the same move ordering as the list method - saves ~170msec on a depth 7 search for a given board configuration - there is room to improve the pre-allocation size estimates, these bounds are not obviously tight and it may or may not be faster to have tighter bounds or even some form of estimation
41 hours	switch to explicit game state & important bug fix & clang format	tslil 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.
41 hours	Welcome 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.
41 hours	Fix copyright notice in files, and small preemptive optimisation	tslil 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.
41 hours	Rename ct_k -> ct, IANAL but ...	tslil

41 hours	Try to squeeze out a little more performance	tslil clingman
	``Common wisdom'' dictates that placements are often better than stack moves, so we bias the generated move list in this fashion. Seems to be a little faster.
41 hours	Added license information!	tslil clingman

41 hours	It would appear that any function call whatsoever is slower :/	tslil clingman
	For now we'll stay with directly recomputing it at each non-terminal node
41 hours	Somehting along these lines, i'm tired	tslil clingman

41 hours	Storing best moves!	tslil clingman