ctak/include, branch sixes An implementation of Tak and a computer opponent in C https://git.l-3.space/ctak/atom/include?h=sixes 2021-03-28T03:59:33Z Playing around with huge nn's, poorly trained. 2021-03-28T03:59:33Z tslil tslil@posteo.de 2021-03-28T03:59:33Z urn:sha1:4cb4d7a24c3bcd263ce6fb4b83ebbde017650ed2 Not great at shallow depths Rename ct_k -> ct, IANAL but ... 2021-02-05T21:49:14Z tslil tslil@posteo.de 2021-02-05T21:49:14Z urn:sha1:5c8e082276a24b9f266396874d3e72c05990a3df TEI interface working! 2021-02-05T05:12:18Z tslil clingman tslil@posteo.de 2021-02-03T00:23:54Z urn:sha1:4f20d9fd63b6b3e30130c84c20f7cdbbbf2df76d Tried some naive iterative deepening. Work on TEI interface next 2021-02-02T02:46:24Z tslil clingman tslil@posteo.de 2021-02-02T02:46:24Z urn:sha1:41b5dc810e25724e8111cf7f2ad1b4b52f9b1206 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. Just some #weightgoals ;) 2021-02-01T04:33:39Z tslil clingman tslil@posteo.de 2021-02-01T04:33:39Z urn:sha1:a7d80d7346a7c6944d917df4903342527b17d71c It turns out that while i was training on a 0/1 classification problem, i was using 2*eval - 1. Training using this function instead, and on bot-dominated game choices (chosen_player in extract.sh) seems to have given a better evaluation function. At the least, Morten's swindle doesn't work anymore. Fairly important bug fixes to lcdlib, LCD now echoes input! 2021-01-31T23:27:41Z tslil clingman tslil@posteo.de 2021-01-31T20:33:30Z urn:sha1:948b4286d0b5c5a647d2ab3dd20cd12301f166be Input polling without line-buffering is done using ncurses, so the buildroot configuration had to change accordingly to include that library. The Makefile changed to accommodate stand-alone building of ct1986 and to include -lcurses where appropriate. There were also some typos about copying ct1986 and ctaklm to the correct directories. Try to squeeze out a little more performance 2021-01-30T21:47:48Z tslil clingman tslil@posteo.de 2021-01-30T21:47:48Z urn:sha1:e19c535d4b52c845e1b6f8bbc9d8e21c27bc1e4a ``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. Purged uninteresting statistics 2021-01-29T22:52:58Z tslil tslil@posteo.de 2021-01-29T22:52:58Z urn:sha1:cb7f039d2740e882c7ae7d53634c92b7164c90fe Added license information! 2021-01-29T02:30:30Z tslil clingman tslil@posteo.de 2021-01-29T02:30:30Z urn:sha1:e8fd4e0fd0056c3f91d9b773f5e727614b0c2638 Print progress before recursion rather than after 2021-01-29T01:46:43Z tslil clingman tslil@posteo.de 2021-01-29T01:46:43Z urn:sha1:b58e324e0b626c588905ee92a2ae0eaf1d6b328d