aboutsummaryrefslogtreecommitdiff
path: root/include/tak.c
AgeCommit message (Collapse)Author
45 hoursMore towel wringing: re-implemented check_road_colourtslil
Previously check_win would call check_road_colour once for each road colour, and check_road_colour would call a depth-first search (DFS) for each of the two axes. This meant that we were doing (up to) *four* depth-first searches for each call of check_win. I have replaced both axial DFS with the world's worst TM implementation of a connected component generation algorithm backed by the least guaranteed disjoint set data structure. Essentially doing anything about union find correctly is slower than just ... not doing it. Although we lose the asymptotic complexity, in practice we're doing this millions of times per turn, for a fixed board size and that's what matters. All in all, it appears that i've managed to shave about 69ns off check_win, per call -- nice! This amounts to 50ms or so saved at depth 5 per engine move, in one of my test games. Unfortunately nearly 99% of the time is still taken by evaluating the convolutional neural network. It's slow.
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 hoursTEI interface working!tslil clingman
45 hoursAdded license information!tslil clingman
45 hoursStill tryingtslil clingman
|
45 hoursFinally (?) fixed winning avoidancetslil clingman
45 hoursMany fixes, i think this is actually correcttslil clingman
45 hoursIn-lined as much as a i daretslil clingman
45 hoursInlined placements, should be fastertslil clingman
45 hoursAnother road bugtslil
45 hoursDragon is not separate, fixed concession, allowing playing as b/wtslil
45 hoursChanged function back to macrotslil
45 hoursFixed minimax (!), fixed bugs in tak.ctslil
With minimax of depth 1 the evaluation function seems alright with the current method of training and generating weights
45 hoursTrying minimaxtslil
45 hoursCrass errortslil
45 hoursWell it works, and it's bad. Many bugs fixed in interimtslil
45 hoursFixed a small bug in PTN parsing, other stufftslil
45 hoursCheck for road wins before flat winstslil
45 hoursTabs for indentation, spaces for alignmenttslil
45 hoursFixed indentation and some bugs, stats programmetslil
45 hoursSet dialect to C99tslil
45 hoursIncorrect usage of globals in headertslil
45 hoursIn-lined a few things, reworked flat count to iterate only oncetslil
45 hourstak.h now tracks win state, optimisations, saved a byte on countstslil
45 hoursLine-mode mostly completetslil
45 hoursFixed road DFS errorstslil
45 hoursCorrected PTN move parsingtslil
45 hoursAdded linenoise library, uninitialised variable + renamingtslil
45 hoursBetter as single file headertslil
45 hoursOBOEs in try_move + logic errorstslil
- Corrected use of static - Implemented next_turn
45 hoursWorking on the big wrapper for everythingtslil
45 hoursStarted on PTN stufftslil
45 hoursChanged representation, implemented most basic things for tak.htslil
45 hoursInittslil