-
Notifications
You must be signed in to change notification settings - Fork 7
/
tbprobe.c
2101 lines (1853 loc) · 58.5 KB
/
tbprobe.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (c) 2013-2020 Ronald de Man
* Copyright (c) 2015 Basil, all rights reserved,
* Modifications Copyright (c) 2016-2019 by Jon Dart
* Modifications Copyright (c) 2020-2024 by Andrew Grant
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <assert.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifdef __cplusplus
#include <atomic>
#else
#include <stdatomic.h>
#endif
#include "tbprobe.h"
#define TB_PIECES (7)
#define TB_HASHBITS (TB_PIECES < 7 ? 11 : 12)
#define TB_MAX_DTZ (0x40000)
#define TB_MAX_PIECE (TB_PIECES < 7 ? 254 : 650)
#define TB_MAX_PAWN (TB_PIECES < 7 ? 256 : 861)
#define TB_MAX_SYMS (4096)
#define TB_BEST_NONE (0xFFFF)
#define TB_SCORE_ILLEGAL (0x7FFF)
#define TB_MOVE_STALEMATE (0xFFFF)
#define TB_MOVE_CHECKMATE (0xFFFE)
#ifndef _WIN32
#include <fcntl.h>
#include <pthread.h>
#include <unistd.h>
#include <sys/mman.h>
#include <sys/stat.h>
#define SEP_CHAR ':'
#define FD int
#define FD_ERR -1
typedef size_t map_t;
#else
#ifndef NOMINMAX
#define NOMINMAX
#endif
#include <windows.h>
#define SEP_CHAR ';'
#define FD HANDLE
#define FD_ERR INVALID_HANDLE_VALUE
typedef HANDLE map_t;
#endif
#ifdef __cplusplus
using namespace std;
#endif
#define DECOMP64
#if defined(__cplusplus) && (__cplusplus >= 201103L)
#include <mutex>
#define LOCK_T std::mutex
#define LOCK_INIT(x)
#define LOCK_DESTROY(x)
#define LOCK(x) x.lock()
#define UNLOCK(x) x.unlock()
#else
#ifndef _WIN32
#define LOCK_T pthread_mutex_t
#define LOCK_INIT(x) pthread_mutex_init(&(x), NULL)
#define LOCK_DESTROY(x) pthread_mutex_destroy(&(x))
#define LOCK(x) pthread_mutex_lock(&(x))
#define UNLOCK(x) pthread_mutex_unlock(&(x))
#else
#define LOCK_T HANDLE
#define LOCK_INIT(x) do { x = CreateMutex(NULL, FALSE, NULL); } while (0)
#define LOCK_DESTROY(x) CloseHandle(x)
#define LOCK(x) WaitForSingleObject(x, INFINITE)
#define UNLOCK(x) ReleaseMutex(x)
#endif
#endif
#define TB_MAX(a,b) ((a) > (b) ? (a) : (b))
#define TB_MIN(a,b) ((a) < (b) ? (a) : (b))
#include "stdendian.h"
#if _BYTE_ORDER == _BIG_ENDIAN
static uint32_t from_le_u32(uint32_t x) { return bswap32(x); }
static uint16_t from_le_u16(uint16_t x) { return bswap16(x); }
static uint64_t from_be_u64(uint64_t x) { return x; }
static uint32_t from_be_u32(uint32_t x) { return x; }
#else
static uint32_t from_le_u32(uint32_t x) { return x; }
static uint16_t from_le_u16(uint16_t x) { return x; }
static uint64_t from_be_u64(uint64_t x) { return bswap64(x); }
static uint32_t from_be_u32(uint32_t x) { return bswap32(x); }
#endif
inline static uint32_t read_le_u32(void *p) { return from_le_u32(*(uint32_t *)p); }
inline static uint16_t read_le_u16(void *p) { return from_le_u16(*(uint16_t *)p); }
static size_t file_size(FD fd) {
#ifdef _WIN32
LARGE_INTEGER fileSize;
if (GetFileSizeEx(fd, &fileSize)==0) {
return 0;
}
return (size_t)fileSize.QuadPart;
#else
struct stat buf;
if (fstat(fd,&buf)) {
return 0;
} else {
return buf.st_size;
}
#endif
}
static LOCK_T tbMutex;
static int initialized = 0;
static int numPaths = 0;
static char *pathString = NULL;
static char **paths = NULL;
static FD open_tb(const char *str, const char *suffix)
{
int i;
FD fd;
char *file;
for (i = 0; i < numPaths; i++) {
file = (char*)malloc(strlen(paths[i]) + strlen(str) +
strlen(suffix) + 2);
strcpy(file, paths[i]);
#ifdef _WIN32
strcat(file,"\\");
#else
strcat(file,"/");
#endif
strcat(file, str);
strcat(file, suffix);
#ifndef _WIN32
fd = open(file, O_RDONLY);
#else
#ifdef _UNICODE
wchar_t ucode_name[4096];
size_t len;
mbstowcs_s(&len, ucode_name, 4096, file, _TRUNCATE);
fd = CreateFile(ucode_name, GENERIC_READ, FILE_SHARE_READ, NULL,
OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);
#else
fd = CreateFile(file, GENERIC_READ, FILE_SHARE_READ, NULL,
OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);
#endif
#endif
free(file);
if (fd != FD_ERR) {
return fd;
}
}
return FD_ERR;
}
static void close_tb(FD fd)
{
#ifndef _WIN32
close(fd);
#else
CloseHandle(fd);
#endif
}
static void *map_file(FD fd, map_t *mapping)
{
#ifndef _WIN32
struct stat statbuf;
if (fstat(fd, &statbuf)) {
perror("fstat");
close_tb(fd);
return NULL;
}
*mapping = statbuf.st_size;
void *data = mmap(NULL, statbuf.st_size, PROT_READ,
MAP_SHARED, fd, 0);
#if defined(MADV_RANDOM)
madvise(data, statbuf.st_size, MADV_RANDOM);
#endif
if (data == MAP_FAILED) {
perror("mmap");
return NULL;
}
#else
DWORD size_low, size_high;
size_low = GetFileSize(fd, &size_high);
HANDLE map = CreateFileMapping(fd, NULL, PAGE_READONLY, size_high, size_low,
NULL);
if (map == NULL) {
fprintf(stderr,"CreateFileMapping() failed, error = %lu.\n", GetLastError());
return NULL;
}
*mapping = (map_t)map;
void *data = (void *)MapViewOfFile(map, FILE_MAP_READ, 0, 0, 0);
if (data == NULL) {
fprintf(stderr,"MapViewOfFile() failed, error = %lu.\n", GetLastError());
}
#endif
return data;
}
#ifndef _WIN32
static void unmap_file(void *data, map_t size)
{
if (!data) return;
if (munmap(data, size) < 0) {
perror("munmap");
}
}
#else
static void unmap_file(void *data, map_t mapping)
{
if (!data) return;
if (!UnmapViewOfFile(data)) {
fprintf(stderr, "unmap failed, error code %lu\n", GetLastError());
}
if (!CloseHandle((HANDLE)mapping)) {
fprintf(stderr, "CloseHandle failed, error code %lu\n", GetLastError());
}
}
#endif
int TB_MaxCardinality = 0, TB_MaxCardinalityDTM = 0;
int TB_LARGEST = 0;
int TB_NUM_WDL = 0;
int TB_NUM_DTM = 0;
int TB_NUM_DTZ = 0;
static const char *tbSuffix[] = { ".rtbw", ".rtbm", ".rtbz" };
static uint32_t tbMagic[] = { 0x5d23e871, 0x88ac504b, 0xa50c66d7 };
enum { WDL, DTM, DTZ };
enum { PIECE_ENC, FILE_ENC, RANK_ENC };
// Attack and move generation code
#include "tbchess.c"
struct PairsData {
uint8_t *indexTable;
uint16_t *sizeTable;
uint8_t *data;
uint16_t *offset;
uint8_t *symLen;
uint8_t *symPat;
uint8_t blockSize;
uint8_t idxBits;
uint8_t minLen;
uint8_t constValue[2];
uint64_t base[1];
};
struct EncInfo {
struct PairsData *precomp;
size_t factor[TB_PIECES];
uint8_t pieces[TB_PIECES];
uint8_t norm[TB_PIECES];
};
struct BaseEntry {
uint64_t key;
uint8_t *data[3];
map_t mapping[3];
#ifdef __cplusplus
atomic<bool> ready[3];
#else
atomic_bool ready[3];
#endif
uint8_t num;
bool symmetric, hasPawns, hasDtm, hasDtz;
union {
bool kk_enc;
uint8_t pawns[2];
};
bool dtmLossOnly;
};
struct PieceEntry {
struct BaseEntry be;
struct EncInfo ei[5]; // 2 + 2 + 1
uint16_t *dtmMap;
uint16_t dtmMapIdx[2][2];
void *dtzMap;
uint16_t dtzMapIdx[4];
uint8_t dtzFlags;
};
struct PawnEntry {
struct BaseEntry be;
struct EncInfo ei[24]; // 4 * 2 + 6 * 2 + 4
uint16_t *dtmMap;
uint16_t dtmMapIdx[6][2][2];
void *dtzMap;
uint16_t dtzMapIdx[4][4];
uint8_t dtzFlags[4];
bool dtmSwitched;
};
struct TbHashEntry {
uint64_t key;
struct BaseEntry *ptr;
};
static int tbNumPiece, tbNumPawn;
static int numWdl, numDtm, numDtz;
static struct PieceEntry *pieceEntry;
static struct PawnEntry *pawnEntry;
static struct TbHashEntry tbHash[1 << TB_HASHBITS];
static void init_indices(void);
// Forward declarations. These functions without the tb_
// prefix take a pos structure as input.
static int probe_wdl(PyrrhicPosition *pos, int *success);
static int probe_dtz(PyrrhicPosition *pos, int *success);
int root_probe_wdl(const PyrrhicPosition *pos, bool useRule50, struct TbRootMoves *rm);
int root_probe_dtz(const PyrrhicPosition *pos, bool hasRepeated, struct TbRootMoves *rm);
static uint16_t probe_root(PyrrhicPosition *pos, int *score, unsigned *results);
static unsigned dtz_to_wdl(int cnt50, int dtz) {
int wdl = 0;
if (dtz > 0) wdl = dtz + cnt50 <= 100 ? 2: 1;
else if (dtz < 0) wdl = -dtz + cnt50 <= 100 ? -2: -1;
return wdl + 2;
}
unsigned tb_probe_wdl(
uint64_t white, uint64_t black,
uint64_t kings, uint64_t queens,
uint64_t rooks, uint64_t bishops,
uint64_t knights, uint64_t pawns,
unsigned ep, bool turn) {
PyrrhicPosition pos = {
white, black, kings,
queens, rooks, bishops,
knights, pawns, 0,
(uint8_t)ep, turn
};
int success;
int v = probe_wdl(&pos, &success);
if (success == 0)
return TB_RESULT_FAILED;
return (unsigned)(v + 2);
}
unsigned tb_probe_root(
uint64_t white, uint64_t black,
uint64_t kings, uint64_t queens,
uint64_t rooks, uint64_t bishops,
uint64_t knights, uint64_t pawns,
unsigned rule50, unsigned ep,
bool turn, unsigned *results) {
PyrrhicPosition pos = {
white, black, kings,
queens, rooks, bishops,
knights, pawns, (uint8_t)rule50,
(uint8_t)ep, turn
};
int dtz;
PyrrhicMove move = probe_root(&pos, &dtz, results);
if (move == 0) return TB_RESULT_FAILED;
if (move == TB_MOVE_CHECKMATE) return TB_RESULT_CHECKMATE;
if (move == TB_MOVE_STALEMATE) return TB_RESULT_STALEMATE;
unsigned res = 0;
res = TB_SET_WDL(res, dtz_to_wdl(rule50, dtz));
res = TB_SET_DTZ(res, dtz < 0 ? -dtz : dtz);
res = TB_SET_FROM(res, pyrrhic_move_from(move));
res = TB_SET_TO(res, pyrrhic_move_to(move));
res = TB_SET_PROMOTES(res, pyrrhic_move_promotes(move));
res = TB_SET_EP(res, pyrrhic_is_en_passant(&pos, move));
return res;
}
int tb_probe_root_dtz(
uint64_t white, uint64_t black,
uint64_t kings, uint64_t queens,
uint64_t rooks, uint64_t bishops,
uint64_t knights, uint64_t pawns,
unsigned rule50, unsigned ep,
bool turn, bool hasRepeated,
struct TbRootMoves *results) {
PyrrhicPosition pos = {
white, black, kings,
queens, rooks, bishops,
knights, pawns, (uint8_t)rule50,
(uint8_t)ep, turn
};
return root_probe_dtz(&pos, hasRepeated, results);
}
int tb_probe_root_wdl(
uint64_t white, uint64_t black,
uint64_t kings, uint64_t queens,
uint64_t rooks, uint64_t bishops,
uint64_t knights, uint64_t pawns,
unsigned rule50, unsigned ep,
bool turn, bool useRule50,
struct TbRootMoves *results) {
PyrrhicPosition pos = {
white, black, kings,
queens, rooks, bishops,
knights, pawns, (uint8_t)rule50,
(uint8_t)ep, turn
};
return root_probe_wdl(&pos, useRule50, results);
}
static void prt_str(const PyrrhicPosition *pos, char *str, int flip) {
// Given a position, produce a string of the form KQPvKRP.
// Allow flip to be set to swap White v Black to Black v White
int color = flip ? PYRRHIC_BLACK : PYRRHIC_WHITE;
for (int pt = PYRRHIC_KING; pt >= PYRRHIC_PAWN; pt--)
for (int i = PYRRHIC_POPCOUNT(pyrrhic_pieces_by_type(pos, color, pt)); i > 0; i--)
*str++ = pyrrhic_piece_to_char[pt];
*str++ = 'v';
for (int pt = PYRRHIC_KING; pt >= PYRRHIC_PAWN; pt--)
for (int i = PYRRHIC_POPCOUNT(pyrrhic_pieces_by_type(pos, color^1, pt)); i > 0; i--)
*str++ = pyrrhic_piece_to_char[pt];
*str++ = 0;
}
static int test_tb(const char *str, const char *suffix) {
FD fd = open_tb(str, suffix);
if (fd != FD_ERR) {
size_t size = file_size(fd);
close_tb(fd);
if ((size & 63) != 16) {
fprintf(stderr, "Incomplete tablebase file %s.%s\n", str, suffix);
printf("info string Incomplete tablebase file %s.%s\n", str, suffix);
fd = FD_ERR;
}
}
return fd != FD_ERR;
}
static void *map_tb(const char *name, const char *suffix, map_t *mapping) {
FD fd = open_tb(name, suffix);
if (fd == FD_ERR)
return NULL;
void *data = map_file(fd, mapping);
if (data == NULL) {
fprintf(stderr, "Could not map %s%s into memory.\n", name, suffix);
exit(EXIT_FAILURE);
}
close_tb(fd);
return data;
}
static void add_to_hash(struct BaseEntry *ptr, uint64_t key) {
int idx;
idx = key >> (64 - TB_HASHBITS);
while (tbHash[idx].ptr)
idx = (idx + 1) & ((1 << TB_HASHBITS) - 1);
tbHash[idx].key = key;
tbHash[idx].ptr = ptr;
}
#define tb_pchr(i) pyrrhic_piece_to_char[PYRRHIC_QUEEN - (i)]
#define PYRRHIC_SWAP(a,b) {int tmp=a;a=b;b=tmp;}
static void init_tb(char *str)
{
if (!test_tb(str, tbSuffix[WDL]))
return;
int pcs[16];
for (int i = 0; i < 16; i++)
pcs[i] = 0;
int color = 0;
for (char *s = str; *s; s++)
if (*s == 'v')
color = 8;
else {
int piece_type = pyrrhic_char_to_piece_type(*s);
if (piece_type) {
assert((piece_type | color) < 16);
pcs[piece_type | color]++;
}
}
uint64_t key = pyrrhic_calc_key_from_pcs(pcs, 0);
uint64_t key2 = pyrrhic_calc_key_from_pcs(pcs, 1);
bool hasPawns = pcs[PYRRHIC_WPAWN] || pcs[PYRRHIC_BPAWN];
struct BaseEntry *be = hasPawns ? &pawnEntry[tbNumPawn++].be
: &pieceEntry[tbNumPiece++].be;
be->hasPawns = hasPawns;
be->key = key;
be->symmetric = key == key2;
be->num = 0;
for (int i = 0; i < 16; i++)
be->num += pcs[i];
numWdl++;
numDtm += be->hasDtm = test_tb(str, tbSuffix[DTM]);
numDtz += be->hasDtz = test_tb(str, tbSuffix[DTZ]);
if (be->num > TB_MaxCardinality) {
TB_MaxCardinality = be->num;
}
if (be->hasDtm)
if (be->num > TB_MaxCardinalityDTM) {
TB_MaxCardinalityDTM = be->num;
}
for (int type = 0; type < 3; type++)
atomic_init(&be->ready[type], false);
if (!be->hasPawns) {
int j = 0;
for (int i = 0; i < 16; i++)
if (pcs[i] == 1) j++;
be->kk_enc = j == 2;
} else {
be->pawns[0] = pcs[PYRRHIC_WPAWN];
be->pawns[1] = pcs[PYRRHIC_BPAWN];
if (pcs[PYRRHIC_BPAWN] && (!pcs[PYRRHIC_WPAWN] || pcs[PYRRHIC_WPAWN] > pcs[PYRRHIC_BPAWN]))
PYRRHIC_SWAP(be->pawns[0], be->pawns[1]);
}
add_to_hash(be, key);
if (key != key2)
add_to_hash(be, key2);
}
#define PIECEENTRY(x) ((struct PieceEntry *)(x))
#define PAWNENTRY(x) ((struct PawnEntry *)(x))
int num_tables(struct BaseEntry *be, const int type)
{
return be->hasPawns ? type == DTM ? 6 : 4 : 1;
}
struct EncInfo *first_ei(struct BaseEntry *be, const int type)
{
return be->hasPawns
? &PAWNENTRY(be)->ei[type == WDL ? 0 : type == DTM ? 8 : 20]
: &PIECEENTRY(be)->ei[type == WDL ? 0 : type == DTM ? 2 : 4];
}
static void free_tb_entry(struct BaseEntry *be)
{
for (int type = 0; type < 3; type++) {
if (atomic_load_explicit(&be->ready[type], memory_order_relaxed)) {
unmap_file((void*)(be->data[type]), be->mapping[type]);
int num = num_tables(be, type);
struct EncInfo *ei = first_ei(be, type);
for (int t = 0; t < num; t++) {
free(ei[t].precomp);
if (type != DTZ)
free(ei[num + t].precomp);
}
atomic_store_explicit(&be->ready[type], false, memory_order_relaxed);
}
}
}
bool tb_init(const char *path)
{
if (!initialized) {
init_indices();
initialized = 1;
}
TB_LARGEST = 0;
TB_NUM_WDL = 0;
TB_NUM_DTZ = 0;
TB_NUM_DTM = 0;
// if pathString is set, we need to clean up first.
if (pathString) {
free(pathString);
free(paths);
for (int i = 0; i < tbNumPiece; i++)
free_tb_entry((struct BaseEntry *)&pieceEntry[i]);
for (int i = 0; i < tbNumPawn; i++)
free_tb_entry((struct BaseEntry *)&pawnEntry[i]);
LOCK_DESTROY(tbMutex);
pathString = NULL;
numWdl = numDtm = numDtz = 0;
}
// if path is an empty string or equals "<empty>", we are done.
const char *p = path;
if (strlen(p) == 0 || !strcmp(p, "<empty>")) return true;
pathString = (char*)malloc(strlen(p) + 1);
strcpy(pathString, p);
numPaths = 0;
for (int i = 0;; i++) {
if (pathString[i] != SEP_CHAR)
numPaths++;
while (pathString[i] && pathString[i] != SEP_CHAR)
i++;
if (!pathString[i]) break;
pathString[i] = 0;
}
paths = (char**)malloc(numPaths * sizeof(*paths));
for (int i = 0, j = 0; i < numPaths; i++) {
while (!pathString[j]) j++;
paths[i] = &pathString[j];
while (pathString[j]) j++;
}
LOCK_INIT(tbMutex);
tbNumPiece = tbNumPawn = 0;
TB_MaxCardinality = TB_MaxCardinalityDTM = 0;
if (!pieceEntry) {
pieceEntry = (struct PieceEntry*)malloc(TB_MAX_PIECE * sizeof(*pieceEntry));
pawnEntry = (struct PawnEntry*)malloc(TB_MAX_PAWN * sizeof(*pawnEntry));
if (!pieceEntry || !pawnEntry) {
fprintf(stderr, "Out of memory.\n");
exit(EXIT_FAILURE);
}
}
for (int i = 0; i < (1 << TB_HASHBITS); i++) {
tbHash[i].key = 0;
tbHash[i].ptr = NULL;
}
char str[16];
int i, j, k, l, m;
for (i = 0; i < 5; i++) {
snprintf(str, 16, "K%cvK", tb_pchr(i));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++) {
snprintf(str, 16, "K%cvK%c", tb_pchr(i), tb_pchr(j));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++) {
snprintf(str, 16, "K%c%cvK", tb_pchr(i), tb_pchr(j));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = 0; k < 5; k++) {
snprintf(str, 16, "K%c%cvK%c", tb_pchr(i), tb_pchr(j), tb_pchr(k));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = j; k < 5; k++) {
snprintf(str, 16, "K%c%c%cvK", tb_pchr(i), tb_pchr(j), tb_pchr(k));
init_tb(str);
}
// 6- and 7-piece TBs make sense only with a 64-bit address space
if (sizeof(size_t) < 8 || TB_PIECES < 6)
goto finished;
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = i; k < 5; k++)
for (l = (i == k) ? j : k; l < 5; l++) {
snprintf(str, 16, "K%c%cvK%c%c", tb_pchr(i), tb_pchr(j), tb_pchr(k), tb_pchr(l));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = j; k < 5; k++)
for (l = 0; l < 5; l++) {
snprintf(str, 16, "K%c%c%cvK%c", tb_pchr(i), tb_pchr(j), tb_pchr(k), tb_pchr(l));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = j; k < 5; k++)
for (l = k; l < 5; l++) {
snprintf(str, 16, "K%c%c%c%cvK", tb_pchr(i), tb_pchr(j), tb_pchr(k), tb_pchr(l));
init_tb(str);
}
if (TB_PIECES < 7)
goto finished;
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = j; k < 5; k++)
for (l = k; l < 5; l++)
for (m = l; m < 5; m++) {
snprintf(str, 16, "K%c%c%c%c%cvK", tb_pchr(i), tb_pchr(j), tb_pchr(k), tb_pchr(l), tb_pchr(m));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = j; k < 5; k++)
for (l = k; l < 5; l++)
for (m = 0; m < 5; m++) {
snprintf(str, 16, "K%c%c%c%cvK%c", tb_pchr(i), tb_pchr(j), tb_pchr(k), tb_pchr(l), tb_pchr(m));
init_tb(str);
}
for (i = 0; i < 5; i++)
for (j = i; j < 5; j++)
for (k = j; k < 5; k++)
for (l = 0; l < 5; l++)
for (m = l; m < 5; m++) {
snprintf(str, 16, "K%c%c%cvK%c%c", tb_pchr(i), tb_pchr(j), tb_pchr(k), tb_pchr(l), tb_pchr(m));
init_tb(str);
}
finished:
// Set TB_LARGEST, for backward compatibility with pre-7-man Fathom
TB_LARGEST = TB_MaxCardinality;
if (TB_MaxCardinalityDTM > TB_LARGEST) {
TB_LARGEST = TB_MaxCardinalityDTM;
}
TB_NUM_WDL = numWdl;
TB_NUM_DTZ = numDtz;
TB_NUM_DTM = numDtm;
return true;
}
void tb_free(void)
{
tb_init("");
free(pieceEntry);
free(pawnEntry);
pieceEntry = NULL;
pawnEntry = NULL;
}
static const int8_t OffDiag[] = {
0,-1,-1,-1,-1,-1,-1,-1,
1, 0,-1,-1,-1,-1,-1,-1,
1, 1, 0,-1,-1,-1,-1,-1,
1, 1, 1, 0,-1,-1,-1,-1,
1, 1, 1, 1, 0,-1,-1,-1,
1, 1, 1, 1, 1, 0,-1,-1,
1, 1, 1, 1, 1, 1, 0,-1,
1, 1, 1, 1, 1, 1, 1, 0
};
static const uint8_t Triangle[] = {
6, 0, 1, 2, 2, 1, 0, 6,
0, 7, 3, 4, 4, 3, 7, 0,
1, 3, 8, 5, 5, 8, 3, 1,
2, 4, 5, 9, 9, 5, 4, 2,
2, 4, 5, 9, 9, 5, 4, 2,
1, 3, 8, 5, 5, 8, 3, 1,
0, 7, 3, 4, 4, 3, 7, 0,
6, 0, 1, 2, 2, 1, 0, 6
};
static const uint8_t FlipDiag[] = {
0, 8, 16, 24, 32, 40, 48, 56,
1, 9, 17, 25, 33, 41, 49, 57,
2, 10, 18, 26, 34, 42, 50, 58,
3, 11, 19, 27, 35, 43, 51, 59,
4, 12, 20, 28, 36, 44, 52, 60,
5, 13, 21, 29, 37, 45, 53, 61,
6, 14, 22, 30, 38, 46, 54, 62,
7, 15, 23, 31, 39, 47, 55, 63
};
static const uint8_t Lower[] = {
28, 0, 1, 2, 3, 4, 5, 6,
0, 29, 7, 8, 9, 10, 11, 12,
1, 7, 30, 13, 14, 15, 16, 17,
2, 8, 13, 31, 18, 19, 20, 21,
3, 9, 14, 18, 32, 22, 23, 24,
4, 10, 15, 19, 22, 33, 25, 26,
5, 11, 16, 20, 23, 25, 34, 27,
6, 12, 17, 21, 24, 26, 27, 35
};
static const uint8_t Diag[] = {
0, 0, 0, 0, 0, 0, 0, 8,
0, 1, 0, 0, 0, 0, 9, 0,
0, 0, 2, 0, 0, 10, 0, 0,
0, 0, 0, 3, 11, 0, 0, 0,
0, 0, 0, 12, 4, 0, 0, 0,
0, 0, 13, 0, 0, 5, 0, 0,
0, 14, 0, 0, 0, 0, 6, 0,
15, 0, 0, 0, 0, 0, 0, 7
};
static const uint8_t Flap[2][64] = {
{ 0, 0, 0, 0, 0, 0, 0, 0,
0, 6, 12, 18, 18, 12, 6, 0,
1, 7, 13, 19, 19, 13, 7, 1,
2, 8, 14, 20, 20, 14, 8, 2,
3, 9, 15, 21, 21, 15, 9, 3,
4, 10, 16, 22, 22, 16, 10, 4,
5, 11, 17, 23, 23, 17, 11, 5,
0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0,
0, 1, 2, 3, 3, 2, 1, 0,
4, 5, 6, 7, 7, 6, 5, 4,
8, 9, 10, 11, 11, 10, 9, 8,
12, 13, 14, 15, 15, 14, 13, 12,
16, 17, 18, 19, 19, 18, 17, 16,
20, 21, 22, 23, 23, 22, 21, 20,
0, 0, 0, 0, 0, 0, 0, 0 }
};
static const uint8_t PawnTwist[2][64] = {
{ 0, 0, 0, 0, 0, 0, 0, 0,
47, 35, 23, 11, 10, 22, 34, 46,
45, 33, 21, 9, 8, 20, 32, 44,
43, 31, 19, 7, 6, 18, 30, 42,
41, 29, 17, 5, 4, 16, 28, 40,
39, 27, 15, 3, 2, 14, 26, 38,
37, 25, 13, 1, 0, 12, 24, 36,
0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0,
47, 45, 43, 41, 40, 42, 44, 46,
39, 37, 35, 33, 32, 34, 36, 38,
31, 29, 27, 25, 24, 26, 28, 30,
23, 21, 19, 17, 16, 18, 20, 22,
15, 13, 11, 9, 8, 10, 12, 14,
7, 5, 3, 1, 0, 2, 4, 6,
0, 0, 0, 0, 0, 0, 0, 0 }
};
static const int16_t KKIdx[10][64] = {
{ -1, -1, -1, 0, 1, 2, 3, 4,
-1, -1, -1, 5, 6, 7, 8, 9,
10, 11, 12, 13, 14, 15, 16, 17,
18, 19, 20, 21, 22, 23, 24, 25,
26, 27, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41,
42, 43, 44, 45, 46, 47, 48, 49,
50, 51, 52, 53, 54, 55, 56, 57 },
{ 58, -1, -1, -1, 59, 60, 61, 62,
63, -1, -1, -1, 64, 65, 66, 67,
68, 69, 70, 71, 72, 73, 74, 75,
76, 77, 78, 79, 80, 81, 82, 83,
84, 85, 86, 87, 88, 89, 90, 91,
92, 93, 94, 95, 96, 97, 98, 99,
100,101,102,103,104,105,106,107,
108,109,110,111,112,113,114,115},
{116,117, -1, -1, -1,118,119,120,
121,122, -1, -1, -1,123,124,125,
126,127,128,129,130,131,132,133,
134,135,136,137,138,139,140,141,
142,143,144,145,146,147,148,149,
150,151,152,153,154,155,156,157,
158,159,160,161,162,163,164,165,
166,167,168,169,170,171,172,173 },
{174, -1, -1, -1,175,176,177,178,
179, -1, -1, -1,180,181,182,183,
184, -1, -1, -1,185,186,187,188,
189,190,191,192,193,194,195,196,
197,198,199,200,201,202,203,204,
205,206,207,208,209,210,211,212,
213,214,215,216,217,218,219,220,
221,222,223,224,225,226,227,228 },
{229,230, -1, -1, -1,231,232,233,
234,235, -1, -1, -1,236,237,238,
239,240, -1, -1, -1,241,242,243,
244,245,246,247,248,249,250,251,
252,253,254,255,256,257,258,259,
260,261,262,263,264,265,266,267,
268,269,270,271,272,273,274,275,
276,277,278,279,280,281,282,283 },
{284,285,286,287,288,289,290,291,
292,293, -1, -1, -1,294,295,296,
297,298, -1, -1, -1,299,300,301,
302,303, -1, -1, -1,304,305,306,
307,308,309,310,311,312,313,314,
315,316,317,318,319,320,321,322,
323,324,325,326,327,328,329,330,
331,332,333,334,335,336,337,338 },
{ -1, -1,339,340,341,342,343,344,
-1, -1,345,346,347,348,349,350,
-1, -1,441,351,352,353,354,355,
-1, -1, -1,442,356,357,358,359,
-1, -1, -1, -1,443,360,361,362,
-1, -1, -1, -1, -1,444,363,364,
-1, -1, -1, -1, -1, -1,445,365,
-1, -1, -1, -1, -1, -1, -1,446 },
{ -1, -1, -1,366,367,368,369,370,
-1, -1, -1,371,372,373,374,375,
-1, -1, -1,376,377,378,379,380,
-1, -1, -1,447,381,382,383,384,
-1, -1, -1, -1,448,385,386,387,
-1, -1, -1, -1, -1,449,388,389,
-1, -1, -1, -1, -1, -1,450,390,
-1, -1, -1, -1, -1, -1, -1,451 },
{452,391,392,393,394,395,396,397,
-1, -1, -1, -1,398,399,400,401,
-1, -1, -1, -1,402,403,404,405,
-1, -1, -1, -1,406,407,408,409,
-1, -1, -1, -1,453,410,411,412,
-1, -1, -1, -1, -1,454,413,414,
-1, -1, -1, -1, -1, -1,455,415,
-1, -1, -1, -1, -1, -1, -1,456 },
{457,416,417,418,419,420,421,422,
-1,458,423,424,425,426,427,428,
-1, -1, -1, -1, -1,429,430,431,
-1, -1, -1, -1, -1,432,433,434,
-1, -1, -1, -1, -1,435,436,437,
-1, -1, -1, -1, -1,459,438,439,
-1, -1, -1, -1, -1, -1,460,440,
-1, -1, -1, -1, -1, -1, -1,461 }
};
static const uint8_t FileToFile[] = { 0, 1, 2, 3, 3, 2, 1, 0 };
static const int WdlToMap[5] = { 1, 3, 0, 2, 0 };
static const uint8_t PAFlags[5] = { 8, 0, 0, 0, 4 };
static size_t Binomial[7][64];
static size_t PawnIdx[2][6][24];
static size_t PawnFactorFile[6][4];
static size_t PawnFactorRank[6][6];
static void init_indices(void)
{
int i, j, k;
// Binomial[k][n] = Bin(n, k)
for (i = 0; i < 7; i++)
for (j = 0; j < 64; j++) {
size_t f = 1;
size_t l = 1;
for (k = 0; k < i; k++) {
f *= (j - k);
l *= (k + 1);
}
Binomial[i][j] = f / l;
}