ctak/include/actions.c, branch action_list_caching An implementation of Tak and a computer opponent in C https://git.l-3.space/cgit/ctak/atom?h=action_list_caching 2026-08-28T18:37:41Z Working on caching move generation 2026-08-28T18:37:41Z tslil tslil@posteo.de 2021-02-08T18:44:45Z urn:sha1:7dc20b4709b4c641372aedfb3661341e139ac63c Rename ct_k -> ct, IANAL but ... 2026-08-28T18:37:41Z tslil tslil@posteo.de 2021-02-05T21:49:14Z urn:sha1:ce09b6d94ac3dbf426e959b14fd7731001a003d1 Try to squeeze out a little more performance 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-30T21:47:48Z urn:sha1:84ad2e3c12cb505e3c5e3dd29d05edb529b82174 ``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. Added license information! 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-29T02:30:30Z urn:sha1:a77062ce3dc9a99ad0662010cc7eeb00dd5036a6 It would appear that any function call whatsoever is slower :/ 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-28T17:01:42Z urn:sha1:b5b337d4044a8e64956b8a2309739353f9ce339e For now we'll stay with directly recomputing it at each non-terminal node Somehting along these lines, i'm tired 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-27T03:39:28Z urn:sha1:6b48baaf6b67cc7364d5945eb6d9b25ea9683bd9 Storing best moves! 2026-08-28T18:37:41Z tslil clingman tslil@posteo.de 2021-01-26T22:42:53Z urn:sha1:de4f20f28afe23ecfc546ad242e5bb44710996cc