Save 5 bytes for free #95
Conversation
|
The 4ku code is formatted using |
|
clang-format can be enabled or disabled as follows: // clang-format off
...
// clang-format onIf you add these comments around your includes, they will be left in the order you specify. Please note that since creating your PR, another has been merged. You'll have to rebase or merge master to fix the conflicts. |
To make it easier to make the tournament deadline. * Bad bishop eval (kz04px#56). * Late move pruning changes (kz04px#78). * Improving variable (kz04px#83). * Include promotions in qsearch (kz04px#97). Also include kz04px#95 to make this exactly 4096 bytes, and put in tournament settings (hash/threads) that keep the size at exactly that. vs master (432c06a): ELO | 18.58 +- 9.34 (95%) SPRT | 8.0+0.08s Threads=1 Hash=64MB LLR | 2.97 (-2.94, 2.94) [0.00, 5.00] GAMES | N: 3032 W: 945 L: 783 D: 1304
To make it easier to make the tournament deadline. * Bad bishop eval (kz04px#56). * Late move pruning changes (kz04px#78). * Improving variable (kz04px#83). * Include promotions in qsearch (kz04px#97). Also include kz04px#95 to make this exactly 4096 bytes, and put in tournament settings (hash/threads) that keep the size at exactly that. vs master (432c06a): ELO | 18.58 +- 9.34 (95%) SPRT | 8.0+0.08s Threads=1 Hash=64MB LLR | 2.97 (-2.94, 2.94) [0.00, 5.00] GAMES | N: 3032 W: 945 L: 783 D: 1304
To make it easier to make the tournament deadline. * Bad bishop eval (kz04px#56). * Late move pruning changes (kz04px#78). * Improving variable (kz04px#83). * Include promotions in qsearch (kz04px#97). Also include kz04px#95 to make this exactly 4096 bytes, and put in tournament settings (hash/threads) that keep the size below target. vs master (432c06a): ELO | 18.58 +- 9.34 (95%) SPRT | 8.0+0.08s Threads=1 Hash=64MB LLR | 2.97 (-2.94, 2.94) [0.00, 5.00] GAMES | N: 3032 W: 945 L: 783 D: 1304
|
Sorry for the late response and merry christmas! I see that this is already merged into this fork, so I wont change anything here for now. Note that compression is unpredictable so run this optimization last. If there is time before the competition you can test if more can be saved, here's the code I used to brute-force the order (I'm sure there's a smarter way to do this): random.shuffle(headers)
open("test", "wb").write(b"\n".join(headers+main))
score = int(os.popen("lzma -kc9 test | wc -c").read().strip()) |
No description provided.