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
|
#if !defined(NOEGTB)
# include "chess.h"
# include "data.h"
/* last modified 01/17/09 */
/*
*******************************************************************************
* *
* EGTBProbe() is the interface to the new tablebase code by Eugene Nalimov. *
* This is called from Search() after a capture, when the number of pieces *
* remaining on the board is less than or equal to the max number of pieces *
* we have in the EGTB files that are available for use. *
* *
*******************************************************************************
*/
# define VInitSqCtr(rgCtr, rgSquares, piece, bitboard) { \
int cPieces=0; \
BITBOARD bbTemp=(bitboard); \
while (bbTemp) { \
const squaret sq=MSB(bbTemp); \
(rgSquares)[(piece)*C_PIECES+cPieces]=sq; \
cPieces++; \
Clear(sq, bbTemp); \
} \
(rgCtr)[(piece)]=cPieces; \
}
# define T_INDEX64
# define C_PIECES 3 /* Maximum # of pieces of one color OTB */
# if defined (T_INDEX64) && defined (_MSC_VER)
typedef unsigned __int64 INDEX;
# elif defined (T_INDEX64)
typedef unsigned long long INDEX;
# else
typedef unsigned long INDEX;
# endif
typedef unsigned int squaret;
/* Those declarations necessary because Crafty is C, not C++ program */
# if defined (_MSC_VER)
# define TB_FASTCALL __fastcall
# else
# define TB_FASTCALL
# endif
typedef int pcolor;
# define x_colorWhite 0
# define x_colorBlack 1
# define x_colorNeutral 2
# define COLOR_DECLARED
typedef int piece;
# define x_pieceNone 0
# define x_piecePawn 1
# define x_pieceKnight 2
# define x_pieceBishop 3
# define x_pieceRook 4
# define x_pieceQueen 5
# define x_pieceKing 6
# define PIECES_DECLARED
typedef signed char tb_t;
# define pageL 65536
# define tbbe_ssL ((pageL-4)/2)
# define bev_broken (tbbe_ssL+1) /* illegal or busted */
# define bev_mi1 tbbe_ssL /* mate in 1 move */
# define bev_mimin 1 /* mate in max moves */
# define bev_draw 0 /* draw */
# define bev_limax (-1) /* mated in max moves */
# define bev_li0 (-tbbe_ssL)
/* mated in 0 moves */
typedef INDEX(TB_FASTCALL * PfnCalcIndex)
(squaret *, squaret *, squaret, int fInverse);
extern int IDescFindFromCounters(int *);
extern int FRegisteredFun(int, pcolor);
extern PfnCalcIndex PfnIndCalcFun(int, pcolor);
extern int TB_FASTCALL L_TbtProbeTable(int, pcolor, INDEX);
# define PfnIndCalc PfnIndCalcFun
# define FRegistered FRegisteredFun
int EGTBProbe(TREE * RESTRICT tree, int ply, int wtm, int *score) {
int rgiCounters[10], iTb, fInvert;
pcolor side;
squaret rgsqWhite[C_PIECES * 5 + 1], rgsqBlack[C_PIECES * 5 + 1];
squaret *psqW, *psqB, sqEnP;
INDEX ind;
int tbValue;
/*
************************************************************
* *
* Initialize counters and piece arrays so the probe code *
* can compute the modified Godel number. *
* *
************************************************************
*/
VInitSqCtr(rgiCounters, rgsqWhite, 0, Pawns(white));
VInitSqCtr(rgiCounters, rgsqWhite, 1, Knights(white));
VInitSqCtr(rgiCounters, rgsqWhite, 2, Bishops(white));
VInitSqCtr(rgiCounters, rgsqWhite, 3, Rooks(white));
VInitSqCtr(rgiCounters, rgsqWhite, 4, Queens(white));
VInitSqCtr(rgiCounters + 5, rgsqBlack, 0, Pawns(black));
VInitSqCtr(rgiCounters + 5, rgsqBlack, 1, Knights(black));
VInitSqCtr(rgiCounters + 5, rgsqBlack, 2, Bishops(black));
VInitSqCtr(rgiCounters + 5, rgsqBlack, 3, Rooks(black));
VInitSqCtr(rgiCounters + 5, rgsqBlack, 4, Queens(black));
/*
************************************************************
* *
* Quick early exit. Is the tablebase for the current *
* set of pieces registered? *
* *
************************************************************
*/
iTb = IDescFindFromCounters(rgiCounters);
if (!iTb)
return (0);
/*
************************************************************
* *
* Yes, finish setting up to probe the tablebase. If *
* black is the "winning" side (more pieces) then we need *
* to "invert" the pieces in the lists. *
* *
************************************************************
*/
rgsqWhite[C_PIECES * 5] = KingSQ(white);
rgsqBlack[C_PIECES * 5] = KingSQ(black);
if (iTb > 0) {
side = wtm ? x_colorWhite : x_colorBlack;
fInvert = 0;
psqW = rgsqWhite;
psqB = rgsqBlack;
} else {
side = wtm ? x_colorBlack : x_colorWhite;
fInvert = 1;
psqW = rgsqBlack;
psqB = rgsqWhite;
iTb = -iTb;
}
/*
************************************************************
* *
* Now check to see if this particular tablebase for this *
* color to move is registered. *
* *
************************************************************
*/
if (!FRegistered(iTb, side))
return (0);
sqEnP = EnPassant(ply) ? EnPassant(ply) : 127;
ind = PfnIndCalc(iTb, side) (psqW, psqB, sqEnP, fInvert);
tbValue = L_TbtProbeTable(iTb, side, ind);
if (bev_broken == tbValue)
return (0);
/*
************************************************************
* *
* Convert to correct MATE range to match the value *
* Crafty uses. *
* *
************************************************************
*/
if (tbValue > 0)
*score = MATE + 2 * (-bev_mi1 + tbValue - 1);
else if (tbValue < 0)
*score = -MATE + 2 * (bev_mi1 + tbValue);
else
*score = DrawScore(wtm);
return (1);
}
#endif
|
