ctak/include/tak.c, branch lazy_queue An implementation of Tak and a computer opponent in C https://git.l-3.space/ctak/atom?h=lazy_queue 2026-08-28T18:37:41Z More towel wringing: re-implemented check_road_colour 2026-08-28T18:37:41Z tslil tslil@posteo.de 2021-07-02T16:00:00Z urn:sha1:07c5dded49d5943f54cca0c75a7a93a30ee2f323 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. Fix copyright notice in files, and small preemptive optimisation 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-03-28T04:19:05Z urn:sha1:2dbb9fa9b69e49d49cebb1c17559f6fe67600a4d 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. Rename ct_k -> ct, IANAL but ... 2026-08-28T18:37:41Z tslil tslil@posteo.de 2021-02-05T21:49:14Z urn:sha1:ce09b6d94ac3dbf426e959b14fd7731001a003d1 TEI interface working! 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-02-03T00:23:54Z urn:sha1:40c6b1dafab4de169bac8a799e7953e85061218e Added license information! 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-29T02:30:30Z urn:sha1:a77062ce3dc9a99ad0662010cc7eeb00dd5036a6 Still trying 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-24T17:07:18Z urn:sha1:815cde44e5060ad093347bb47fc66d41c9d3a3ed | Finally (?) fixed winning avoidance 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-21T19:56:55Z urn:sha1:eab1d81df4455eb89b2663dcdd45a024f4633a2e Many fixes, i think this is actually correct 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-21T06:16:20Z urn:sha1:9fa3291044ff8d9f0f2b9c9a01cd210bf318ab74 In-lined as much as a i dare 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-20T18:23:58Z urn:sha1:c81898d6a760e2057f0933c9da6160702a4d0f61 Inlined placements, should be faster 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-18T04:16:09Z urn:sha1:b1d677fa134741527669b93a77810cf01dd34de5