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

Age	Commit message (Collapse)	Author
47 hours	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.
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	Tried some naive iterative deepening. Work on TEI interface next	tslil clingman
	If TEI is implemented, then i could make use of Morten's racetrack (https://github.com/MortenLohne/racetrack) and develop a quantitative measure of the bot's performance. This is the current priority.
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	Print progress before recursion rather than after	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	I don't have the presence of mind to debug this right now	tslil clingman

47 hours	Small changes to build ct1986	tslil clingman

47 hours	Storing best moves!	tslil clingman

47 hours	This matches alpha-beta!	tslil clingman

47 hours	Stable negamax-alpha-beta fail-soft	tslil clingman

47 hours	Once again, adding TT changes the outcome	tslil clingman

47 hours	Actually it seems before i was mis-counting	tslil clingman

47 hours	There is still a bug, it doesn't appear to be checking enough	tslil clingman

47 hours	Stripping debug stuff	tslil clingman

47 hours	Still bugs...	tslil clingman

47 hours	Still some bugs, standing stone becomes flat at depth4 self-play??	tslil clingman

47 hours	There are still some bugs in the undo almost surely...	tslil clingman

47 hours	Lots of bugfixes, mostly uint vs int. Still weirdness in game	tslil clingman

47 hours	This is the basic idea, there's ≥ 1 bug (generates illegals...)	tslil clingman

47 hours	Working on action lists to refactor	tslil clingman

47 hours	Still trying	tslil clingman
	\|
47 hours	Hash collisions	tslil clingman

47 hours	Fixed some important bugs	tslil clingman

47 hours	Attempting Zobrist hashing	tslil clingman