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

Age	Commit message (Collapse)	Author
2 days	experimenting with a lazy queue implementationlazy_queue	tslil
	presently it's not correct
2 days	Trying to make things faster	tslil
	I tried the following, but they all made things worse: - moving away from the singly-linked (tail tracking) list for actions by: + using an array zipper for a deque + using an array to poorly hold a floating deque - caching the results of generating move lists in the transposition table and then + copying the resulting list/zip/deque instead of generating it + applying the move-to-front without copying, but this made the search order worse. Presumably in this case shallower nodes were messing up the search tree with garbage moves? I think some of this is not supposed to happen, but i have just the right combination of poor evaluation function and naively ordered and cheap move generation that i'm in a local minimum here.
2 days	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.
2 days	Rename ct_k -> ct, IANAL but ...	tslil

2 days	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.
2 days	Added license information!	tslil clingman

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

2 days	Storing best moves!	tslil clingman