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

Age	Commit message (Collapse)	Author
47 hours	experimenting with a lazy queue implementationlazy_queue	tslil
	presently it's not correct
47 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.
47 hours	Rename ct_k -> ct, IANAL but ...	tslil

47 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.
47 hours	Added license information!	tslil clingman

47 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
47 hours	Somehting along these lines, i'm tired	tslil clingman

47 hours	Storing best moves!	tslil clingman