1 /***********************************************************************/
\r
3 /* A WinBoard engine for large (dropless) Shogi variants by H.G.Muller */
\r
4 /* The engine is based on incremental updating of an attack map and */
\r
5 /* mobility scores, since the effort in this only grows proportional */
\r
6 /* to board edge length, rather than board area. */
\r
7 /***********************************************************************/
\r
10 // in GenCapts we do not generate jumps of more than two squares yet
\r
11 // promotions by pieces with Lion power stepping in & out the zone in same turn
\r
12 // promotion on capture
\r
14 #define VERSION "0.15"
\r
16 #define PATH level==0 /*|| path[0] == 0x3490a && (level==1 || path[1] == 0x285b3 && (level == 2 || path[2] == 0x8710f && (level == 3 /*|| path[3] == 0x3e865 && (level == 4 || path[4] == 0x4b865 && (level == 5)))))*/
\r
38 # include <windows.h>
\r
40 { // checks for waiting input in pipe
\r
41 static int pipe, init;
\r
45 if(!init) inp = GetStdHandle(STD_INPUT_HANDLE);
\r
46 if(!PeekNamedPipe(inp, NULL, 0, NULL, &cnt, NULL)) return 1;
\r
50 # include <sys/time.h>
\r
51 # include <sys/ioctl.h>
\r
55 if(ioctl(0, FIONREAD, &cnt)) return 1;
\r
58 int GetTickCount() // with thanks to Tord
\r
60 gettimeofday(&t, NULL);
\r
61 return t.tv_sec*1000 + t.tv_usec/1000;
\r
68 #define BWMAX (2*BHMAX)
\r
69 #define BSIZE BWMAX*BHMAX
\r
72 #define ONE (currentVariant == V_SHO || currentVariant == V_CHESS || currentVariant == V_SHATRANJ || currentVariant == V_MAKRUK)
\r
77 #define EDGE (1<<11)
\r
78 #define TYPE (WHITE|BLACK|EDGE)
\r
81 #define NPIECES EDGE+1 /* length of piece list */
\r
83 #define SQLEN 11 /* bits in square number */
\r
84 #define SQUARE ((1<<SQLEN) - 1) /* mask for square in move */
\r
85 #define DEFER (1<<2*SQLEN) /* deferral on zone entry */
\r
86 #define PROMOTE (1<<2*SQLEN+1) /* promotion bit in move */
\r
87 #define SPECIAL 1400 /* start of special moves */
\r
88 #define BURN (SPECIAL + 96) /* start of burn encodings */
\r
89 #define STEP(X,Y) (BW*(X)+ (Y))
\r
90 #define SORTKEY(X) 0
\r
92 #define UPDATE_MOBILITY(X,Y)
\r
93 #define ADDMOVE(X,Y)
\r
96 #define CAN_PROMOTE 0x11
\r
97 #define DONT_DEFER 0x22
\r
98 #define CANT_DEFER 0x44
\r
99 #define LAST_RANK 0x88
\r
100 #define P_WHITE 0x0F
\r
101 #define P_BLACK 0xF0
\r
103 typedef unsigned int Move;
\r
105 char *MoveToText(Move move, int m); // from WB driver
\r
106 void pmap(int *m, int col);
\r
107 void pboard(int *b);
\r
108 void pbytes(unsigned char *b);
\r
113 short int score[5];
\r
119 HashBucket *hashTable;
\r
126 char *name, *promoted;
\r
128 signed char range[8];
\r
131 int whiteKey, blackKey;
\r
135 int from, to, piece, victim, new, booty, epSquare, epVictim[8], ep2Square, revMoveCount;
\r
136 int savKeyL, savKeyH, gain, loss, filling, saveDelta;
\r
140 char *array, fenArray[4000], startPos[4000], *reason, checkStack[300];
\r
141 int bWidth, bHeight, bsize, zone, currentVariant, chuFlag, tenFlag, chessFlag, repDraws, tsume, pvCuts, allowRep, entryProm;
\r
142 int stm, xstm, hashKeyH=1, hashKeyL=1, framePtr, msp, nonCapts, rootEval, filling, promoDelta;
\r
143 int retMSP, retFirst, retDep, pvPtr, level, cnt50, mobilityScore;
\r
144 int ll, lr, ul, ur; // corner squares
\r
145 int nodes, startTime, lastRootMove, lastRootIter, tlim1, tlim2, tlim3, repCnt, comp, abortFlag;
\r
147 Move retMove, moveStack[10000], path[100], repStack[300], pv[1000], repeatMove[300], killer[100][2];
\r
149 int maxDepth; // used by search
\r
151 #define X 36 /* slider */
\r
152 #define R 37 /* jump capture */
\r
153 #define N -1 /* Knight */
\r
154 #define J -2 /* jump */
\r
155 #define D -3 /* linear double move */
\r
156 #define T -4 /* linear triple move */
\r
157 #define L -5 /* true Lion move */
\r
158 #define F -6 /* Lion + 3-step */
\r
159 #define S -7 /* Lion + range */
\r
160 #define H -9 /* hook move */
\r
161 #define C -10 /* capture only */
\r
162 #define M -11 /* non-capture only */
\r
164 #define LVAL 1000 /* piece value of Lion. Used in chu for recognizing it to implement Lion-trade rules */
\r
165 #define FVAL 5000 /* piece value of Fire Demon. Used in code for recognizing moves with it and do burns */
\r
167 PieceDesc chuPieces[] = {
\r
168 {"LN", "", LVAL, { L,L,L,L,L,L,L,L }, 4 }, // lion
\r
169 {"FK", "", 600, { X,X,X,X,X,X,X,X }, 4 }, // free king
\r
170 {"SE", "", 550, { X,D,X,X,X,X,X,D }, 4 }, // soaring eagle
\r
171 {"HF", "", 500, { D,X,X,X,X,X,X,X }, 4 }, // horned falcon
\r
172 {"FO", "", 400, { X,X,0,X,X,X,0,X }, 4 }, // flying ox
\r
173 {"FB", "", 400, { 0,X,X,X,0,X,X,X }, 4 }, // free boar
\r
174 {"DK", "SE", 400, { X,1,X,1,X,1,X,1 }, 4 }, // dragon king
\r
175 {"DH", "HF", 350, { 1,X,1,X,1,X,1,X }, 4 }, // dragon horse
\r
176 {"WH", "", 350, { X,X,0,0,X,0,0,X }, 3 }, // white horse
\r
177 {"R", "DK", 300, { X,0,X,0,X,0,X,0 }, 4 }, // rook
\r
178 {"FS", "", 300, { X,1,1,1,X,1,1,1 }, 3 }, // flying stag
\r
179 {"WL", "", 250, { X,0,0,X,X,X,0,0 }, 4 }, // whale
\r
180 {"K", "", 280, { 1,1,1,1,1,1,1,1 }, 2, 4 }, // king
\r
181 {"CP", "", 270, { 1,1,1,1,1,1,1,1 }, 2, 4 }, // king
\r
182 {"B", "DH", 250, { 0,X,0,X,0,X,0,X }, 2 }, // bishop
\r
183 {"VM", "FO", 200, { X,0,1,0,X,0,1,0 }, 2 }, // vertical mover
\r
184 {"SM", "FB", 200, { 1,0,X,0,1,0,X,0 }, 6 }, // side mover
\r
185 {"DE", "CP", 201, { 1,1,1,1,0,1,1,1 }, 2 }, // drunk elephant
\r
186 {"BT", "FS", 152, { 0,1,1,1,1,1,1,1 }, 2 }, // blind tiger
\r
187 {"G", "R", 151, { 1,1,1,0,1,0,1,1 }, 2 }, // gold
\r
188 {"FL", "B", 150, { 1,1,0,1,1,1,0,1 }, 2 }, // ferocious leopard
\r
189 {"KN", "LN", 154, { J,1,J,1,J,1,J,1 }, 2 }, // kirin
\r
190 {"PH", "FK", 153, { 1,J,1,J,1,J,1,J }, 2 }, // phoenix
\r
191 {"RV", "WL", 150, { X,0,0,0,X,0,0,0 }, 1 }, // reverse chariot
\r
192 {"L", "WH", 150, { X,0,0,0,0,0,0,0 }, 1 }, // lance
\r
193 {"S", "VM", 100, { 1,1,0,1,0,1,0,1 }, 2 }, // silver
\r
194 {"C", "SM", 100, { 1,1,0,0,1,0,0,1 }, 2 }, // copper
\r
195 {"GB", "DE", 50, { 1,0,0,0,1,0,0,0 }, 1 }, // go between
\r
196 {"P", "G", 40, { 1,0,0,0,0,0,0,0 }, 2 }, // pawn
\r
197 { NULL } // sentinel
\r
200 PieceDesc shoPieces[] = {
\r
201 {"DK", "", 700, { X,1,X,1,X,1,X,1 } }, // dragon king
\r
202 {"DH", "", 520, { 1,X,1,X,1,X,1,X } }, // dragon horse
\r
203 {"R", "DK", 500, { X,0,X,0,X,0,X,0 } }, // rook
\r
204 {"B", "DH", 320, { 0,X,0,X,0,X,0,X } }, // bishop
\r
205 {"K", "", 410, { 1,1,1,1,1,1,1,1 } }, // king
\r
206 {"CP", "", 400, { 1,1,1,1,1,1,1,1 } }, // king
\r
207 {"DE", "CP", 250, { 1,1,1,1,0,1,1,1 } }, // silver
\r
208 {"G", "", 220, { 1,1,1,0,1,0,1,1 } }, // gold
\r
209 {"S", "G", 200, { 1,1,0,1,0,1,0,1 } }, // silver
\r
210 {"L", "G", 150, { X,0,0,0,0,0,0,0 } }, // lance
\r
211 {"N", "G", 110, { N,0,0,0,0,0,0,N } }, // Knight
\r
212 {"P", "G", 80, { 1,0,0,0,0,0,0,0 } }, // pawn
\r
213 { NULL } // sentinel
\r
216 PieceDesc daiPieces[] = {
\r
217 {"FD", "G", 150, { 0,2,0,2,0,2,0,2 }, 2 }, // Flying Dragon
\r
218 {"VO", "G", 200, { 2,0,2,0,2,0,2,0 }, 2 }, // Violent Ox
\r
219 {"EW", "G", 80, { 1,1,1,0,0,0,1,1 }, 2 }, // Evil Wolf
\r
220 {"CS", "G", 70, { 0,1,0,1,0,1,0,1 }, 1 }, // Cat Sword
\r
221 {"AB", "G", 60, { 1,0,1,0,1,0,1,0 }, 1 }, // Angry Boar
\r
222 {"I", "G", 80, { 1,1,0,0,0,0,0,1 }, 2 }, // Iron
\r
223 {"N", "G", 60, { N,0,0,0,0,0,0,N }, 0 }, // Knight
\r
224 {"ST", "G", 50, { 0,1,0,0,0,0,0,1 }, 0 }, // Stone
\r
225 { NULL } // sentinel
\r
228 PieceDesc ddPieces[] = {
\r
229 {"LO", "", 10, { 1,H,1,H,1,H,1,H } }, // Long-Nosed Goblin
\r
230 {"OK", "LO", 10, { 2,1,2,0,2,0,2,1 } }, // Old Kite
\r
231 {"PS", "HM", 10, { J,0,1,J,0,J,1,0 } }, // Poisonous Snake
\r
232 {"GE", "", 10, { 3,3,5,5,3,5,5,3 } }, // Great Elephant
\r
233 {"WS", "LD", 10, { 1,1,2,0,1,0,2,1 } }, // Western Barbarian
\r
234 {"EA", "LN", 10, { 2,1,1,0,2,0,1,1 } }, // Eastern Barbarian
\r
235 {"NO", "FE", 10, { 0,2,1,1,0,1,1,2 } }, // Northern Barbarian
\r
236 {"SO", "WE", 10, { 0,1,1,2,0,2,1,1 } }, // Southern Barbarian
\r
237 {"FE", "", 10, { 2,X,2,2,2,2,2,X } }, // Fragrant Elephant
\r
238 {"WE", "", 10, { 2,2,2,X,2,X,2,2 } }, // White Elephant
\r
239 {"FT", "", 10, { X,X,5,0,X,0,5,X } }, // Free Dream-Eater
\r
240 {"FR", "", 10, { 5,X,X,0,5,0,X,X } }, // Free Demon
\r
241 {"WB", "FT", 10, { 2,X,X,X,2,X,X,X } }, // Water Buffalo
\r
242 {"RB", "FR", 10, { X,X,X,X,0,X,X,X } }, // Rushing Bird
\r
243 {"SB", "", 10, { X,X,2,2,2,2,2,X } }, // Standard Bearer
\r
245 {"FH", "FK", 10, { 1,2,1,0,1,0,1,2 } }, // Flying Horse
\r
246 {"NK", "SB", 10, { 1,1,1,1,1,1,1,1 } }, // Neighbor King
\r
247 {"BM", "MW", 10, { 0,1,1,1,0,1,1,1 } }, // Blind Monkey
\r
248 {"DO", "", 10, { 2,X,2,X,2,X,2,X } }, // Dove
\r
249 {"EB", "DO", 10, { 2,0,2,0,0,0,2,0 } }, // Enchanted Badger
\r
250 {"EF", "SD", 10, { 0,2,0,0,2,0,0,2 } }, // Enchanted Fox
\r
251 {"RA", "", 10, { X,0,X,1,X,1,X,0 } }, // Racing Chariot
\r
252 {"SQ", "", 10, { X,1,X,0,X,0,X,1 } }, // Square Mover
\r
253 {"PR", "SQ", 10, { 1,1,2,1,0,1,2,1 } }, // Prancing Stag
\r
254 {"WT", "", 10, { X,1,2,0,X,0,2,X } }, // White Tiger
\r
255 {"BD", "", 10, { 2,X,X,0,2,0,X,1 } }, // Blue Dragon
\r
256 {"HD", "", 10, { X,0,0,0,1,0,0,0 } }, // Howling Dog
\r
257 {"VB", "", 10, { 0,2,1,0,0,0,1,2 } }, // Violent Bear
\r
258 {"SA", "", 10, { 2,1,0,0,2,0,0,1 } }, // Savage Tiger
\r
259 {"W", "", 10, { 0,2,0,0,0,0,0,2 } }, // Wood
\r
260 {"CS", "DH", 70, { 0,1,0,1,0,1,0,1 } }, // cat sword
\r
261 {"FD", "DK", 150, { 0,2,0,2,0,2,0,2 } }, // flying dragon
\r
262 {"KN", "GD", 150, { J,1,J,1,J,1,J,1 } }, // kirin
\r
263 {"PH", "GB", 150, { 1,J,1,J,1,J,1,J } }, // phoenix
\r
264 {"LN", "FF", 1000, { L,L,L,L,L,L,L,L } }, // lion
\r
265 {"LD", "GE", 10, { T,T,T,T,T,T,T,T } }, // Lion Dog
\r
266 {"AB", "", 10, { 1,0,1,0,1,0,1,0 } }, // Angry Boar
\r
267 {"B", "", 10, { 0,X,0,X,0,X,0,X } }, // Bishop
\r
268 {"C", "", 10, { 1,1,0,0,1,0,0,1 } }, // Copper
\r
269 {"DH", "", 10, { 1,X,1,X,1,X,1,X } }, // Dragon Horse
\r
270 {"DK", "", 10, { X,1,X,1,X,1,X,1 } }, // Dragon King
\r
271 {"FK", "", 10, { } }, //
\r
272 {"EW", "", 10, { 1,1,1,0,0,0,1,1 } }, // Evil Wolf
\r
273 {"FL", "", 10, { } }, //
\r
274 {"", "", 10, { } }, //
\r
275 {"", "", 10, { } }, //
\r
276 {"", "", 10, { } }, //
\r
277 {"", "", 10, { } }, //
\r
278 { NULL } // sentinel
\r
281 PieceDesc makaPieces[] = {
\r
282 {"DV", "", 10, { 0,1,0,1,0,0,1,1 } }, // Deva
\r
283 {"DS", "", 10, { 0,1,1,0,0,1,0,1 } }, // Dark Spirit
\r
284 {"T", "", 10, { 0,1,0,0,1,0,0,1 } }, // Tile
\r
285 {"CS", "", 10, { 1,0,0,1,1,1,0,0 } }, // Coiled Serpent
\r
286 {"RD", "", 10, { 1,0,1,1,1,1,1,0 } }, // Reclining Dragon
\r
287 {"CC", "", 10, { 0,1,1,0,1,0,1,1 } }, // Chinese Cock
\r
288 {"OM", "", 10, { 0,1,0,1,1,1,0,1 } }, // Old Monkey
\r
289 {"BB", "", 10, { 0,1,0,1,X,1,0,1 } }, // Blind Bear
\r
290 {"OR", "", 10, { 0,2,0,0,2,0,0,2 } }, // Old Rat
\r
291 {"LD", "WS", 10, { T,T,T,T,T,T,T,T } }, // Lion Dog
\r
292 {"WR", "", 10, { 0,3,1,3,0,3,1,3 } }, // Wrestler
\r
293 {"GG", "", 10, { 3,1,3,0,3,0,3,1 } }, // Guardian of the Gods
\r
294 {"BD", "", 10, { 0,3,1,0,1,0,1,3 } }, // Budhist Devil
\r
295 {"SD", "", 10, { 5,2,5,2,5,2,5,2 } }, // She-Devil
\r
296 {"DY", "", 10, { J,0,1,0,J,0,1,0 } }, // Donkey
\r
297 {"CP", "", 10, { 0,H,0,2,0,2,0,H } }, // Capricorn
\r
298 {"HM", "", 10, { H,0,H,0,H,0,H,0 } }, // Hook Mover
\r
299 {"SF", "", 10, { 0,1,X,1,0,1,0,1 } }, // Side Flier
\r
300 {"LC", "", 10, { X,0,0,X,1,0,0,X } }, // Left Chariot
\r
301 {"RC", "", 10, { X,X,0,0,1,X,0,0 } }, // Right Chariot
\r
302 {"FG", "", 10, { X,X,X,0,X,0,X,X } }, // Free Gold
\r
303 {"FS", "", 10, { X,X,0,X,0,X,0,X } }, // Free Silver
\r
304 {"FC", "", 10, { X,X,0,0,X,0,0,X } }, // Free Copper
\r
305 {"FI", "", 10, { X,X,0,0,0,0,0,X } }, // Free Iron
\r
306 {"FT", "", 10, { 0,X,0,0,X,0,0,X } }, // Free Tile
\r
307 {"FN", "", 10, { 0,X,0,0,0,0,0,X } }, // Free Stone
\r
308 {"FTg", "", 10, { 0,X,X,X,X,X,X,X } }, // Free Tiger
\r
309 {"FLp", "", 10, { X,X,0,X,X,X,0,X } }, // Free Leopard (Free Boar?)
\r
310 {"FSp", "", 10, { X,0,0,X,X,X,0,0 } }, // Free Serpent (Whale?)
\r
311 {"FrD", "", 10, { X,0,X,X,X,X,X,0 } }, // Free Dragon
\r
312 {"FC", "", 10, { 0,X,0,X,0,X,0,X } }, // Free Cat (Bishop?)
\r
313 {"EM", "", 10, { } }, // Emperor
\r
314 {"TK", "", 10, { } }, // Teaching King
\r
315 {"BS", "", 10, { } }, // Budhist Spirit
\r
316 {"WS", "", 10, { X,X,0,X,1,X,0,X } }, // Wizard Stork
\r
317 {"MW", "", 10, { 1,X,0,X,X,X,0,X } }, // Mountain Witch
\r
318 {"FF", "", 10, { } }, // Furious Fiend
\r
319 {"GD", "", 10, { 2,3,X,3,2,3,X,3 } }, // Great Dragon
\r
320 {"GB", "", 10, { X,3,2,3,X,3,2,3 } }, // Golden Bird
\r
321 {"FrW", "", 10, { } }, // Free Wolf
\r
322 {"FrB", "", 10, { } }, // Free Bear
\r
323 {"BT", "", 10, { X,0,0,X,0,X,0,0 } }, // Bat
\r
324 {"", "", 10, { } }, //
\r
325 { NULL } // sentinel
\r
328 PieceDesc taiPieces[] = {
\r
329 {"", "", 10, { } }, // Peacock
\r
330 {"", "", 10, { } }, // Vermillion Sparrow
\r
331 {"", "", 10, { } }, // Turtle Snake
\r
332 {"", "", 10, { } }, // Silver Hare
\r
333 {"", "", 10, { } }, // Golden Deer
\r
334 {"", "", 10, { } }, //
\r
335 {"", "", 10, { } }, //
\r
336 {"", "", 10, { } }, //
\r
337 { NULL } // sentinel
\r
340 PieceDesc tenjikuPieces[] = { // only those not in Chu, or different (because of different promotion)
\r
341 {"FI", "", FVAL, { X,X,0,X,X,X,0,X } }, // Fire Demon
\r
342 {"GG", "", 1500, { R,R,R,R,R,R,R,R }, 0, 3 }, // Great General
\r
343 {"VG", "", 1400, { 0,R,0,R,0,R,0,R }, 0, 2 }, // Vice General
\r
344 {"RG", "GG",1200, { R,0,R,0,R,0,R,0 }, 0, 1 }, // Rook General
\r
345 {"BG", "VG",1100, { 0,R,0,R,0,R,0,R }, 0, 1 }, // Bishop General
\r
346 {"SE", "RG", 10, { X,D,X,X,X,X,X,D } }, // Soaring Eagle
\r
347 {"HF", "BG", 10, { D,X,X,X,X,X,X,X } }, // Horned Falcon
\r
348 {"LH", "", 10, { L,S,L,S,L,S,L,S } }, // Lion-Hawk
\r
349 {"LN", "LH",LVAL, { L,L,L,L,L,L,L,L } }, // Lion
\r
350 {"FE", "", 1, { X,X,X,X,X,X,X,X } }, // Free Eagle
\r
351 {"FK", "FE", 600, { X,X,X,X,X,X,X,X } }, // Free King
\r
352 {"HT", "", 10, { X,X,2,X,X,X,2,X } }, // Heavenly Tetrarchs
\r
353 {"CS", "HT", 10, { X,X,2,X,X,X,2,X } }, // Chariot Soldier
\r
354 {"WB", "FI", 10, { 2,X,X,X,2,X,X,X } }, // Water Buffalo
\r
355 {"VS", "CS", 10, { X,0,2,0,1,0,2,0 } }, // Vertical Soldier
\r
356 {"SS", "WB", 10, { 2,0,X,0,1,0,X,0 } }, // Side Soldier
\r
357 {"I", "VS", 10, { 1,1,0,0,0,0,0,1 } }, // Iron
\r
358 {"N", "SS", 10, { N,0,0,0,0,0,0,N } }, // Knight
\r
359 {"MG", "", 10, { X,0,0,X,0,X,0,0 } }, // Multi-General
\r
360 {"D", "MG", 10, { 1,0,0,1,0,1,0,0 } }, // Dog
\r
361 { NULL } // sentinel
\r
364 PieceDesc taikyokuPieces[] = {
\r
365 {"", "", 10, { } }, //
\r
366 { NULL } // sentinel
\r
369 PieceDesc chessPieces[] = {
\r
370 {"Q", "", 950, { X,X,X,X,X,X,X,X } },
\r
371 {"R", "", 500, { X,0,X,0,X,0,X,0 } },
\r
372 {"B", "", 320, { 0,X,0,X,0,X,0,X } },
\r
373 {"N", "", 300, { N,N,N,N,N,N,N,N } },
\r
374 {"K", "", 280, { 1,1,1,1,1,1,1,1 } },
\r
375 {"P", "Q", 80, { M,C,0,0,0,0,0,C } },
\r
376 { NULL } // sentinel
\r
379 PieceDesc shatranjPieces[] = {
\r
380 {"FK", "", 150, { 0,1,0,1,0,1,0,1 } },
\r
381 {"R", "", 500, { X,0,X,0,X,0,X,0 } },
\r
382 {"B", "", 90, { 0,J,0,J,0,J,0,J } },
\r
383 {"N", "", 300, { N,N,N,N,N,N,N,N } },
\r
384 {"K", "", 280, { 1,1,1,1,1,1,1,1 } },
\r
385 {"P", "FK", 80, { M,C,0,0,0,0,0,C } },
\r
386 { NULL } // sentinel
\r
389 PieceDesc makrukPieces[] = {
\r
390 {"SM","", 150, { 0,1,0,1,0,1,0,1 } },
\r
391 {"R", "", 500, { X,0,X,0,X,0,X,0 } },
\r
392 {"S", "", 200, { 1,1,0,1,0,1,0,1 } }, // silver
\r
393 {"N", "", 300, { N,N,N,N,N,N,N,N } },
\r
394 {"K", "", 280, { 1,1,1,1,1,1,1,1 } },
\r
395 {"P", "SM", 80, { M,C,0,0,0,0,0,C } },
\r
396 { NULL } // sentinel
\r
399 char chuArray[] = "L:FLCSGK:DEGSC:FLL/:RV.B.:BT:KN:PH:BT.B.:RV/:SM:VMR:DH:DK:LN:FK:DK:DHR:VM:SM/PPPPPPPPPPPP/...:GB....:GB..."
\r
400 "/............/............/"
\r
401 "...:gb....:gb.../pppppppppppp/:sm:vmr:dh:dk:fk:ln:dk:dhr:vm:sm/:rv.b.:bt:ph:kn:bt.b.:rv/l:flcsg:dekgsc:fll";
\r
402 char daiArray[] = "LN:STICSGKGSCI:STNL/:RV.:CS.:FL.:BT:DE:BT.:FL.:CS.:RV/.:VO.:AB.:EW:KN:LN:PH:EW.:AB.:VO./R:FD:SM:VMB:DH:DK:FK:DK:DHB:VM:SM:FDR"
\r
403 "/PPPPPPPPPPPPPPP/....:GB.....:GB..../.............../.............../.............../....:gb.....:gb..../ppppppppppppppp/"
\r
404 "r:fd:sm:vmb:dh:dk:fk:dk:dhb:vm:sm:fdr/.:vo.:ab.:ew:ph:ln:kn:ew.:ab.:vo./:rv.:cs.:fl.:bt:de:bt.:fl.:cs.:rv/ln:sticsgkgsci:stnl";
\r
405 char tenArray[] = "LN:FLICSGK:DEGSCI:FLNL/:RV.:CS:CS.:BT:KN:LN:FK:PH:BT.:CS:CS.:RV/:SS:VSB:DH:DK:WB:FI:LH:FE:FI:WB:DK:DHB:VS:SS/"
\r
406 ":SM:VMR:HF:SE:BG:RG:GG:VG:RG:BG:SE:HFR:VM:SM/PPPPPPPPPPPPPPPP/....D......D..../"
\r
407 "................/................/................/................/"
\r
408 "....d......d..../pppppppppppppppp/:sm:vmr:hf:se:bg:rg:vg:gg:rg:bg:se:hfr:vm:sm/"
\r
409 ":ss:vsb:dh:dk:wb:fi:fe:lh:fi:wb:dk:dhb:vs:ss/:rv.:cs:cs.:bt:ph:fk:ln:kn:bt.:cs:cs.:rv/ln:flicsg:dekgsci:flnl";
\r
410 char shoArray[] = "LNSGKGSNL/.B..:DE..R./PPPPPPPPP/........./........./........./ppppppppp/.r..:de..b./lnsgkgsnl";
\r
411 char chessArray[] = "RNBQKBNR/PPPPPPPP/......../......../......../......../pppppppp/rnbqkbnr";
\r
412 char shatArray[]= "RNBK:FKBNR/PPPPPPPP/......../......../......../......../pppppppp/rnbk:fkbnr";
\r
413 char thaiArray[]= "RNSK:SMSNR/......../PPPPPPPP/......../......../pppppppp/......../rnsk:smsnr";
\r
416 int boardWidth, boardFiles, boardRanks, zoneDepth, varNr; // board sizes
\r
417 char *name; // WinBoard name
\r
418 char *array; // initial position
\r
421 typedef enum { V_CHESS, V_SHO, V_CHU, V_DAI, V_TENJIKU, V_DADA, V_MAKA, V_TAI, V_KYOKU, V_SHATRANJ, V_MAKRUK } Variant;
\r
423 VariantDesc variants[] = {
\r
424 { 16, 8, 8, 1, V_CHESS, "normal", chessArray }, // FIDE
\r
425 { 18, 9, 9, 3, V_SHO, "9x9+0_shogi", shoArray }, // Sho
\r
426 { 24, 12, 12, 4, V_CHU, "chu", chuArray }, // Chu
\r
427 { 30, 15, 15, 5, V_DAI, "dai", daiArray }, // Dai
\r
428 { 32, 16, 16, 5, V_TENJIKU, "tenjiku", tenArray }, // Tenjiku
\r
429 { 16, 8, 8, 1, V_SHATRANJ,"shatranj",shatArray}, // Shatranj
\r
430 { 16, 8, 8, 3, V_MAKRUK, "makruk", thaiArray}, // Makruk
\r
432 // { 0, 0, 0, 0, 0 }, // sentinel
\r
433 { 34, 17, 17, 0, V_DADA, "dada", chuArray }, // Dai Dai
\r
434 { 38, 19, 19, 0, V_MAKA, "maka", chuArray }, // Maka Dai Dai
\r
435 { 50, 25, 25, 0, V_TAI, "tai", chuArray }, // Tai
\r
436 { 40, 36, 36, 0, V_KYOKU, "kyoku", chuArray } // Taikyoku
\r
443 Vector direction[] = { // clockwise!
\r
453 { 2, 1}, // Knight jumps
\r
463 int epList[96], ep2List[96], toList[96], reverse[96]; // decoding tables for double and triple moves
\r
464 int kingStep[10], knightStep[10]; // raw tables for step vectors (indexed as -1 .. 8)
\r
465 char fireFlags[10]; // flags for Fire-Demon presence (last two are dummies, which stay 0, for compactify)
\r
466 #define kStep (kingStep+1)
\r
467 #define nStep (knightStep+1)
\r
469 int attackMask[8] = { // indicate which bits in attack-map item are used to count attacks from which direction
\r
480 int rayMask[8] = { // indicate which bits in attack-map item are used to count attacks from which direction
\r
491 int one[] = { // 1 in the bit fields for the various directions
\r
500 0100000000 // marks knight jumps
\r
503 // Main Data structures
\r
506 // Interleaved lists for black and white, white taking the odd slots
\r
507 // Pieces in general have two entries: one for the basic, and one for the promoted version
\r
508 // The unused one gets its position set to the invalid square number ABSENT
\r
509 // The list is sorted by piece value, most valuable pieces first
\r
510 // When a piece is captured in the search, both its versions are marked ABSENT
\r
511 // In the root the list is packed to eliminate all captured pieces
\r
512 // The list contains a table for how far the piece moves in each direction
\r
513 // Range encoding: -3 = full Lion, -2 = on-ray Lion, -1 = plain jump, 0 = none, 1 = step, >1 = (limited) range
\r
515 // A table in board format, containing pairs of consecutive integers for each square (indexed as 2*sqr and 2*sqr+1)
\r
516 // The first integer contains info on black attacks to the square, the second similarly for white attacks
\r
517 // Each integer contains eight 3-bit fields, which count the number of attacks on it with moves in a particular direction
\r
518 // (If there are attacks by range-jumpers, the 3-bit count is increased by 2 over the actual value)
\r
520 // The board has twice as many files as actually used, in 0x88 fashion
\r
521 // The used squares hold the piece numbers (for use as index in the piece list)
\r
522 // Unused squares are set to the invalid piece number EDGE
\r
523 // There are also 3 guard ranks of EDGE on each side
\r
525 // Moves are encoded as 11-bit from-square and to-square numbers packed in the low bits of an int
\r
526 // Special moves (like Lion double moves) are encoded by off-board to-squares above a certain value
\r
527 // Promotions are indicated by bit 22
\r
529 // Entries of 16 bytes, holding a 32-bit signature, 16-bit lower- and upper-bound scores,
\r
530 // 8-bit draft of each of those scores, an age counter that stores the search number of the last access.
\r
531 // The hash key is derived as the XOR of the products pieceKey[piece]*squareKey[square].
\r
533 // the promoBoard contains one byte with flags for each square, to indicate for each side whether the square
\r
534 // is in the promotion zone (twice), on the last two ranks, or on the last rank
\r
535 // the promoFlag field in the piece list can select which bits of this are tested, to see if it
\r
536 // (1) can promote (2) can defer when the to-square is on last rank, last two ranks, or anywhere.
\r
537 // Pawns normally can't defer anywhere, but if the user defers with them, their promoFlag is set to promote on last rank only
\r
545 signed char range[8];
\r
550 unsigned char promoGain;
\r
552 } PieceInfo; // piece-list entry
\r
554 int last[2], royal[2], kylin[2];
\r
555 PieceInfo p[NPIECES]; // piece list
\r
566 } HashEntry; // hash-table entry
\r
568 // Some global variables that control your engine's behavior
\r
572 int noCut=1; // engine-defined option
\r
573 int resign; // engine-defined option
\r
574 int contemptFactor; // likewise
\r
577 int squareKey[BSIZE];
\r
579 int rawBoard[BSIZE + 11*BHMAX + 6];
\r
580 //int attacks[2*BSIZE]; // attack map
\r
581 int attackMaps[200*BSIZE], *attacks = attackMaps;
\r
582 char distance[2*BSIZE]; // distance table
\r
583 char promoBoard[BSIZE]; // flags to indicate promotion zones
\r
584 char rawFire[BSIZE+2*BWMAX]; // flags to indicate squares controlled by Fire Demons
\r
585 signed char PST[4*BSIZE];
\r
587 #define board (rawBoard + 6*BHMAX + 3)
\r
588 #define fireBoard (rawFire + BWMAX + 1)
\r
589 #define dist (distance + BSIZE)
\r
592 ListLookUp (char *name, PieceDesc *list)
\r
593 { // find piece of given name in list of descriptors
\r
594 while(list->name && strcmp(name, list->name)) list++;
\r
595 return (list->name == NULL ? NULL : list);
\r
599 LookUp (char *name, int var)
\r
600 { // search piece of given name in all lists relevant for given variant
\r
603 case V_TENJIKU: // Tenjiku
\r
604 desc = ListLookUp(name, tenjikuPieces);
\r
605 if(desc) return desc;
\r
606 return ListLookUp(name, chuPieces);
\r
608 return ListLookUp(name, shoPieces);
\r
610 desc = ListLookUp(name, daiPieces);
\r
611 if(desc) return desc;
\r
613 return ListLookUp(name, chuPieces);
\r
614 case V_CHESS: // FIDE
\r
615 return ListLookUp(name, chessPieces);
\r
616 case V_SHATRANJ: // Shatranj
\r
617 return ListLookUp(name, shatranjPieces);
\r
618 case V_MAKRUK: // Makruk
\r
619 return ListLookUp(name, makrukPieces);
\r
626 { // remove piece number n from the mentioned side's piece list (and adapt the reference to the displaced pieces!)
\r
628 for(i=stm+2; i<=last[stm]; i+=2)
\r
629 if(p[i].promo > n) p[i].promo -= 2;
\r
630 for(i=n; i<last[stm]; i+=2) {
\r
632 if(i+2 == royal[stm]) royal[stm] -= 2; // NB: squeezing out the King moves up Crown Prince to royal[stm]
\r
633 if(i+2 == kylin[stm]) kylin[stm] -= 2;
\r
634 if(i < 10) fireFlags[i-2] = fireFlags[i];
\r
640 Worse (int a, int b)
\r
641 { // determine if range a not upward compatible with b
\r
642 if(a == b) return 0;
\r
643 if(a >= 0 && b >= 0) return a < b;
\r
644 if(a >= 0) return 1; // a (limited) range can never do the same as a special move
\r
646 case J: return b < J; // any special move is better than a plain jump
\r
647 case D: return b > 2 || b < D;
\r
648 case T: return b > 3 || b < T;
\r
649 case L: return b > 2 || b < D;
\r
650 case F: return b > 3 || b < F || b == T;
\r
651 case S: return b == H || b == T;
\r
652 case H: return b < 0;
\r
653 default: return 1; // a >= 0, so b must be < 0 and can always do something a ranging move cannot do
\r
659 Lance (signed char *r)
\r
660 { // File-bound forward slider
\r
662 for(i=1; i<4; i++) if(r[i] || r[i+4]) return 0;
\r
667 EasyProm (signed char *r)
\r
670 return r[0] == X || r[1] == X || r[7] == X;
\r
674 IsUpwardCompatible (signed char *r, signed char *s)
\r
677 for(i=0; i<8; i++) {
\r
678 if(Worse(r[i], s[i])) return 0;
\r
684 Forward (signed char *r)
\r
687 for(i=2; i<7; i++) if(r[i]) return 0;
\r
692 Range (signed char *r)
\r
695 for(i=0; i<8; i++) {
\r
697 if(r[i] < 0) d == r[i] >= L ? 2 : 36;
\r
703 int multis[2], multiMovers[100];
\r
706 StackMultis (int col)
\r
710 for(i=col+2; i<=last[col]; i+=2) { // scan piece list for multi-capturers
\r
711 for(j=0; j<8; j++) if(p[i].range[j] < J && p[i].range[j] >= S || p[i].value == FVAL) {
\r
712 multiMovers[multis[col]] = i; // found one: put its piece number in list
\r
720 Compactify (int stm)
\r
721 { // remove pieces that are permanently gone (captured or promoted) from one side's piece list
\r
723 for(i=stm+2; i<=last[stm]; i+=2) { // first pass: unpromoted pieces
\r
724 if((k = p[i].promo) >= 0 && p[i].pos == ABSENT) { // unpromoted piece no longer there
\r
725 p[k].promo = -2; // orphan promoted version
\r
729 for(i=stm+2; i<=last[stm]; i+=2) { // second pass: promoted pieces
\r
731 if((k = p[i].promo) == -2 && p[i].pos == ABSENT) { // orphaned promoted piece not present
\r
739 AddPiece (int stm, PieceDesc *list)
\r
742 for(i=stm+2; i<=last[stm]; i += 2) {
\r
743 if(p[i].value < list->value || p[i].value == list->value && (p[i].promo < 0)) break;
\r
746 for(j=last[stm]; j>i; j-= 2) p[j] = p[j-2];
\r
747 p[i].value = v = list->value;
\r
748 for(j=0; j<8; j++) p[i].range[j] = list->range[j^4*(WHITE-stm)];
\r
749 switch(Range(p[i].range)) {
\r
750 case 1: p[i].pst = BH; break;
\r
751 case 2: p[i].pst = bsize; break;
\r
752 default: p[i].pst = bsize + BH; break;
\r
754 key = (stm == WHITE ? &list->whiteKey : &list->blackKey);
\r
755 if(!*key) *key = ~(myRandom()*myRandom());
\r
756 p[i].promoGain = EasyProm(list->range); // flag easy promotion based on white view
\r
757 p[i].pieceKey = *key;
\r
758 p[i].promoFlag = 0;
\r
759 p[i].bulk = list->bulk;
\r
760 p[i].mobWeight = v > 600 ? 0 : v >= 400 ? 1 : v >= 300 ? 2 : v > 150 ? 3 : v >= 100 ? 2 : 0;
\r
761 if(Lance(list->range))
\r
762 p[i].mobWeight = 5 + 3*(list->range[4]==X), p[i].pst = 0; // clear path but don't move forward
\r
763 for(j=stm+2; j<= last[stm]; j+=2) {
\r
764 if(p[j].promo >= i) p[j].promo += 2;
\r
766 if(royal[stm] >= i) royal[stm] += 2;
\r
767 if(kylin[stm] >= i) kylin[stm] += 2;
\r
768 if(p[i].value == (currentVariant == V_SHO ? 410 : 280) ) royal[stm] = i, p[i].pst = 0;
\r
769 p[i].qval = (currentVariant == V_TENJIKU ? list->ranking : 0); // jump-capture hierarchy
\r
774 SetUp(char *array, int var)
\r
776 int i, j, n, m, nr, color;
\r
777 char c, *q, name[3], prince = 0;
\r
778 PieceDesc *p1, *p2;
\r
779 last[WHITE] = 1; last[BLACK] = 0;
\r
781 //printf("next rank: %s\n", array);
\r
782 for(j = BW*i; ; j++) {
\r
784 if(*array == '+') pflag++, array++;
\r
785 c = name[0] = *array++;
\r
787 if(c == '.') continue;
\r
788 if(c == '/') break;
\r
789 name[1] = name[2] = 0;
\r
790 if(c == ':') name[0] = *array++, name[1] = *array++;
\r
791 if(name[0] >= 'a') {
\r
793 name[0] += 'A' - 'a';
\r
794 if(name[1]) name[1] += 'A' - 'a';
\r
795 } else color = WHITE;
\r
796 if(!strcmp(name, "CP")) prince |= color+1; // remember if we added Crown Prince
\r
797 p1 = LookUp(name, var);
\r
798 if(!p1) printf("tellusererror Unknown piece '%s' in setup\n", name), exit(-1);
\r
799 if(pflag && p1->promoted) p1 = LookUp(p1->promoted, var); // use promoted piece instead
\r
800 n = AddPiece(color, p1);
\r
802 if(p1->promoted[0] && !pflag) {
\r
803 if(!strcmp(p1->promoted, "CP")) prince |= color+1; // remember if we added Crown Prince
\r
804 p2 = LookUp(p1->promoted, var);
\r
805 m = AddPiece(color, p2);
\r
808 p[n].promoFlag = IsUpwardCompatible(p2->range, p1->range) * DONT_DEFER + CAN_PROMOTE;
\r
809 if(Forward(p1->range)) p[n].promoFlag |= LAST_RANK; // Pieces that only move forward can't defer on last rank
\r
810 if(!strcmp(p1->name, "N")) p[n].promoFlag |= CANT_DEFER; // Knights can't defer on last 2 ranks
\r
811 p[n].promoFlag &= n&1 ? P_WHITE : P_BLACK;
\r
814 if(p[m].value == LVAL) kylin[color] = n; // remember piece that promotes to Lion
\r
815 } else p[n].promo = -1; // unpromotable piece
\r
816 //printf("piece = %c%-2s %d(%d) %d/%d\n", color ? 'w' : 'b', name, n, m, last[color], last[!color]);
\r
820 // add dummy Crown Princes if not yet added
\r
821 if(!(prince & WHITE+1)) p[AddPiece(WHITE, LookUp("CP", V_CHU))].pos = ABSENT;
\r
822 if(!(prince & BLACK+1)) p[AddPiece(BLACK, LookUp("CP", V_CHU))].pos = ABSENT;
\r
823 for(i=0; i<8; i++) fireFlags[i] = 0;
\r
824 for(i=2, n=1; i<10; i++) if(p[i].value == FVAL) {
\r
825 int x = p[i].pos; // mark all burn zones
\r
826 fireFlags[i-2] = n;
\r
827 if(x != ABSENT) for(j=0; j<8; j++) fireBoard[x+kStep[j]] |= n;
\r
830 for(i=0; i<BH; i++) for(j=0; j<BH; j++) board[BW*i+j] = EMPTY;
\r
831 for(i=WHITE+2; i<=last[WHITE]; i+=2) if(p[i].pos != ABSENT) {
\r
832 if((j = p[i].promo) > 0 && p[i].promoGain)
\r
833 p[i].promoGain = (p[j].value - p[i].value - 30)*1.25, p[i].value = p[j].value - 30;
\r
834 else p[i].promoGain = 0;
\r
835 if(j > 0 && p[i].pst == BH) p[i].pst = 3*BW*BH; // use white pre-prom bonus
\r
836 board[p[i].pos] = i;
\r
837 rootEval += p[i].value + PST[p[i].pst + p[i].pos];
\r
838 promoDelta += p[i].promoGain;
\r
839 filling += p[i].bulk;
\r
840 } else p[i].promoGain = 0;
\r
841 for(i=BLACK+2; i<=last[BLACK]; i+=2) if(p[i].pos != ABSENT) {
\r
842 if((j = p[i].promo) > 0 && p[i].promoGain)
\r
843 p[i].promoGain = (p[j].value - p[i].value - 30)*1.25, p[i].value = p[j].value - 30;
\r
844 else p[i].promoGain = 0;
\r
845 if(j > 0 && p[i].pst == BH) p[i].pst = 3*BW*BH + BH; // use black pre-prom bonus
\r
846 board[p[i].pos] = i;
\r
847 rootEval -= p[i].value + PST[p[i].pst + p[i].pos];
\r
848 promoDelta -= p[i].promoGain;
\r
849 filling += p[i].bulk;
\r
850 } else p[i].promoGain = 0;
\r
851 StackMultis(WHITE);
\r
852 StackMultis(BLACK);
\r
853 stm = WHITE; xstm = BLACK;
\r
858 return rand() ^ rand()>>10 ^ rand() << 10 ^ rand() << 20;
\r
866 currentVariant = variants[var].varNr;
\r
867 bWidth = variants[var].boardWidth;
\r
868 bHeight = variants[var].boardRanks;
\r
869 zone = variants[var].zoneDepth;
\r
870 array = variants[var].array;
\r
871 bsize = bWidth*bHeight;
\r
872 chuFlag = (currentVariant == V_CHU);
\r
873 tenFlag = (currentVariant == V_TENJIKU);
\r
874 chessFlag = (currentVariant == V_CHESS);
\r
875 repDraws = (currentVariant == V_CHESS || currentVariant == V_SHATRANJ || currentVariant == V_MAKRUK);
\r
876 ll = 0; lr = bHeight - 1; ul = (bHeight - 1)*bWidth; ur = ul + bHeight - 1;
\r
878 for(i= -1; i<9; i++) { // board steps in linear coordinates
\r
879 kStep[i] = STEP(direction[i&7].x, direction[i&7].y); // King
\r
880 nStep[i] = STEP(direction[(i&7)+8].x, direction[(i&7)+8].y); // Knight
\r
883 for(i=0; i<8; i++) { // Lion double-move decoding tables
\r
884 for(j=0; j<8; j++) {
\r
885 epList[8*i+j] = kStep[i];
\r
886 toList[8*i+j] = kStep[j] + kStep[i];
\r
887 for(k=0; k<8*i+j; k++)
\r
888 if(epList[k] == toList[8*i+j] && toList[k] == epList[8*i+j])
\r
889 reverse[k] = 8*i+j, reverse[8*i+j] = k;
\r
891 // Lion-Dog triple moves
\r
892 toList[64+i] = 3*kStep[i]; epList[64+i] = kStep[i];
\r
893 toList[72+i] = 3*kStep[i]; epList[72+i] = 2*kStep[i];
\r
894 toList[80+i] = 3*kStep[i]; epList[80+i] = kStep[i]; ep2List[80+i] = 2*kStep[i];
\r
895 toList[88+i] = kStep[i]; epList[88+i] = 2*kStep[i];
\r
898 // fill distance table
\r
899 for(i=0; i<2*BSIZE; i++) {
\r
902 // for(i=0; i<8; i++)
\r
903 // for(j=1; j<BH; j++)
\r
904 // dist[j * kStep[i]] = j;
\r
905 // if(currentVariant == V_TENJIKU)
\r
906 for(i=1-BH; i<BH; i++) for(j=1-BH; j<BH; j++) dist[BW*i+j] = abs(i) > abs(j) ? abs(i) : abs(j);
\r
909 for(i=0; i<bsize; i++) squareKey[i] = ~(myRandom()*myRandom());
\r
912 for(i=0; i<BSIZE + 11*BHMAX + 6; i++) rawBoard[i] = EDGE;
\r
915 for(i=0; i<BH; i++) for(j=0; j<BH; j++) {
\r
917 if(i == 0) v |= LAST_RANK & P_BLACK;
\r
918 if(i < 2) v |= CANT_DEFER & P_BLACK;
\r
919 if(i < ZONE) v |= (CAN_PROMOTE | DONT_DEFER) & P_BLACK; else v &= ~P_BLACK;
\r
920 if(i >= BH-ZONE) v |= (CAN_PROMOTE | DONT_DEFER) & P_WHITE; else v &= ~P_WHITE;
\r
921 if(i >= BH-2) v |= CANT_DEFER & P_WHITE;
\r
922 if(i == BH-1) v |= LAST_RANK & P_WHITE;
\r
923 promoBoard[BW*i + j] = v;
\r
926 // piece-square tables
\r
927 for(j=0; j<BH; j++) {
\r
928 for(i=0; i<BH; i++) {
\r
929 int s = BW*i + j, d = BH*(BH-2) - abs(2*i - BH + 1)*(BH-1) - (2*j - BH + 1)*(2*j - BH + 1);
\r
930 PST[s] = 2*(i==0 | i==BH-1) + (i==1 | i==BH-2); // last-rank markers in null table
\r
931 PST[BH+s] = d/4 - (i == 0 || i == BH-1 ? 5 : 0) - (j == 0 || j == BH-1 ? 5 : 0)
\r
932 + 2*(i==zone || i==BH-zone-1); // stepper centralization
\r
933 PST[BH*BW+s] = d/6; // double-stepper centralization
\r
934 PST[BH*BW+BH+s] = d/12; // slider centralization
\r
935 PST[2*BH*BW+s] = j < 3 || j > BH-4 ? (i < 3 ? 7 : i == 3 ? 4 : i == 4 ? 2 : 0) : 0;
\r
936 PST[2*BH*BW+BH+s] = ((BH-1)*(BH-1) - (2*i - BH + 1)*(2*i - BH + 1) - (2*j - BH + 1)*(2*j - BH + 1))/6;
\r
937 PST[3*BH*BW+s] = PST[3*BH*BW+BH+s] = PST[BH+s]; // as stepper, but with pre-promotion bonus W/B
\r
939 if(zone > 1) PST[3*BW*BH+BW*(BH-1-zone) + j] += 10, PST[3*BW*BH+BH + BW*zone + j] += 10;
\r
942 p[EDGE].qval = 5; // tenjiku jump-capturer sentinel
\r
948 int r, f, score, tot=0;
\r
949 for(r=0; r<BH; r++) for(f=0; f<BH; f++) {
\r
951 int piece = board[s];
\r
952 if(!piece) continue;
\r
953 score = p[piece].value + PST[p[piece].pst + s];
\r
954 if(piece & 1) tot += score; else tot -= score;
\r
962 int r, f, score, tot=0;
\r
963 for(r=0; r<BH; r++) for(f=0; f<BH; f++) {
\r
965 int piece = board[s];
\r
966 if(!piece) continue;
\r
967 score = p[piece].promoGain;
\r
968 if(piece & 1) tot += score; else tot -= score;
\r
976 NewNonCapture (int x, int y, int promoFlags)
\r
978 if(board[y] != EMPTY) return 1; // edge, capture or own piece
\r
979 //if(flag) printf("# add %c%d%c%d, pf=%d\n", x%BW+'a',x/BW,y%BW+'a',y/BW, promoFlags);
\r
980 if( (promoBoard[x] | promoBoard[y]) & promoFlags &&
\r
981 (!entryProm || promoBoard[y] & ~promoBoard[x] & CAN_PROMOTE )){ // piece can promote with this move
\r
982 moveStack[msp++] = moveStack[nonCapts]; // create space for promotion
\r
983 moveStack[nonCapts++] = x<<SQLEN | y | PROMOTE; // push promotion
\r
984 if((promoFlags & promoBoard[y] & (CANT_DEFER | DONT_DEFER | LAST_RANK)) == 0) { // deferral could be a better alternative
\r
985 moveStack[msp++] = x<<SQLEN | y; // push deferral
\r
986 if( (promoBoard[x] & CAN_PROMOTE) == 0 ) { // enters zone
\r
987 moveStack[msp-1] |= DEFER; // flag that promo-suppression takes place after this move
\r
991 moveStack[msp++] = x<<SQLEN | y; // push normal move
\r
992 //if(flag) printf("msp=%d nc=%d\n", msp, nonCapts);
\r
997 NewCapture (int x, int y, int promoFlags)
\r
999 if( (promoBoard[x] | promoBoard[y]) & promoFlags) { // piece can promote with this move
\r
1000 moveStack[msp++] = x<<SQLEN | y | PROMOTE; // push promotion
\r
1001 if((promoFlags & promoBoard[y] & (CANT_DEFER | DONT_DEFER | LAST_RANK)) == 0) { // deferral could be a better alternative
\r
1002 moveStack[msp++] = x<<SQLEN | y; // push deferral
\r
1003 if( (promoBoard[x] & CAN_PROMOTE) == 0 ) { // enters zone
\r
1004 moveStack[msp-1] |= DEFER; // flag that promo-suppression takes place after this move
\r
1008 moveStack[msp++] = x<<SQLEN | y; // push normal move
\r
1012 char map[49]; // 7x7 map for area movers
\r
1013 char mapStep[] = { 7, 8, 1, -6, -7, -8, -1, 6 };
\r
1014 char rowMask[] = { 0100, 0140, 0160, 070, 034, 016, 07, 03, 01 };
\r
1018 AreaStep (int from, int x, int flags, int n, int d)
\r
1021 for(i=0; i<8; i++) {
\r
1022 int to = x + kStep[i], m = n + mapStep[i];
\r
1023 if(board[to] == EDGE) continue; // off board
\r
1024 if(map[m] >= d) continue; // already done
\r
1025 if(!map[m]) moveStack[msp++] = from<<SQLEN | to;
\r
1027 if(d > 1 && board[to] == EMPTY) AreaStep(from, to, flags, m, d-1);
\r
1032 AreaMoves (int from, int piece, int range)
\r
1035 for(i=0; i<49; i++) map[i] = 0;
\r
1036 map[3*7+7] = range;
\r
1037 AreaStep(from, from, p[piece].promoFlag, 3*7+3, range);
\r
1042 { // make bitmap of squares in FI (7x7) neighborhood where opponents can be captured or burned
\r
1043 int r=x>>5, f=x&15, top=8, bottom=0, b=0, t=8, left=0, right=8; // 9x9 area; assumes 32x16 board
\r
1044 if(r < 4) bottom = 4 - r, rows[b=bottom-1] = 0; else
\r
1045 if(r > 11) top = 19 - r, rows[t=top+1] = 0; // adjust area to board edges
\r
1046 if(f < 4) left = 4 - f; else if(f > 11) right = 19 - f;
\r
1047 for(r=bottom; r<=top; r++) {
\r
1048 int mask = 0, y = x + 16*r;
\r
1049 for(f=left; f <= right; f++) {
\r
1050 if(board[y + f - (4*16+4)] != EMPTY && (board[y + f - (4*16+4)] & TYPE) == xstm)
\r
1051 mask |= rowMask[f]; // on-rank attacks
\r
1055 for(r=b; r<=t-2; r++) rows[r] |= rows[r+1] | rows[r+2]; // smear vertically
\r
1059 GenNonCapts (int promoSuppress)
\r
1061 int i, j, nullMove = ABSENT;
\r
1062 for(i=stm+2; i<=last[stm]; i+=2) {
\r
1063 int x = p[i].pos, pFlag = p[i].promoFlag;
\r
1064 if(x == ABSENT) continue;
\r
1065 if(x == promoSuppress && chuFlag) pFlag = 0;
\r
1066 for(j=0; j<8; j++) {
\r
1067 int y, v = kStep[j], r = p[i].range[j];
\r
1068 if(r < 0) { // jumping piece, special treatment
\r
1069 if(r == N) { // pure Knightm do off-ray jump
\r
1070 NewNonCapture(x, x + nStep[j], pFlag);
\r
1072 if(r >= S) { // in any case, do a jump of 2
\r
1073 int occup = NewNonCapture(x, x + 2*v, pFlag);
\r
1074 if(r < J) { // Lion power, also single step
\r
1075 if(!NewNonCapture(x, x + v, pFlag)) nullMove = x; else occup = 1;
\r
1076 if(r <= L) { // true Lion, also Knight jump
\r
1077 if(!occup & r < L) for(y=x+2*v; !NewNonCapture(x, y+=v, pFlag) && r == S; ); // BS and FF moves
\r
1079 NewNonCapture(x, x + v, pFlag);
\r
1083 if(r == M) { // FIDE Pawn; check double-move
\r
1084 if(!NewNonCapture(x, x+v, pFlag) && chessFlag && promoBoard[x-v])
\r
1085 NewNonCapture(x, x+2*v, pFlag), moveStack[msp-1] |= DEFER; // use promoSuppress flag as e.p. flag
\r
1091 if(NewNonCapture(x, y+=v, pFlag)) break;
\r
1098 report (int x, int y, int i)
\r
1103 MapOneColor (int start, int last, int *map)
\r
1105 int i, j, k, totMob = 0;
\r
1106 for(i=start+2; i<=last; i+=2) {
\r
1108 if(p[i].pos == ABSENT) continue;
\r
1109 for(j=0; j<8; j++) {
\r
1110 int x = p[i].pos, v = kStep[j], r = p[i].range[j];
\r
1111 if(r < 0) { // jumping piece, special treatment
\r
1114 if(board[x] != EMPTY && board[x] != EDGE)
\r
1115 map[2*x + start] += one[8];
\r
1117 if(r >= S) { // in any case, do a jump of 2
\r
1118 if(board[x + 2*v] != EMPTY && board[x + 2*v] != EDGE)
\r
1119 map[2*(x + 2*v) + start] += one[j], mob += (board[x + 2*v] ^ start) & 1;
\r
1120 if(r < J) { // Lion power, also single step
\r
1121 if(board[x + v] != EMPTY && board[x + v] != EDGE)
\r
1122 map[2*(x + v) + start] += one[j];
\r
1123 if(r == T) { // Lion Dog, also jump of 3
\r
1124 if(board[x + 3*v] != EMPTY && board[x + 3*v] != EDGE)
\r
1125 map[2*(x + 3*v) + start] += one[j];
\r
1127 if(r <= L) { // true Lion, also Knight jump
\r
1128 if(r < L) { // Lion plus (limited) range
\r
1130 r = (r == S ? 36 : 3);
\r
1132 if(board[y+=v] == EDGE) break;
\r
1133 if(board[y] != EMPTY) {
\r
1134 if(n > 2) map[2*y + start] += one[j]; // outside Lion range
\r
1140 if(board[x + v] != EMPTY && board[x + v] != EDGE)
\r
1141 map[2*(x + v) + start] += one[8];
\r
1145 if(r == C) { // FIDE Pawn diagonal
\r
1146 if(board[x + v] != EMPTY && board[x + v] != EDGE)
\r
1147 map[2*(x + v) + start] += one[j];
\r
1152 if(board[x+=v] != EMPTY) {
\r
1153 mob += dist[x-v-p[i].pos];
\r
1154 if(board[x] != EDGE) map[2*x + start] += one[j], mob += (board[x] ^ start) & 1;
\r
1156 if(p[i].range[j] > X) { // jump capturer
\r
1157 int c = p[i].qval;
\r
1158 if(p[board[x]].qval < c) {
\r
1159 x += v; // go behind directly captured piece, if jumpable
\r
1160 while(p[board[x]].qval < c) { // kludge alert: EDGE has qval = 5, blocking everything
\r
1161 if(board[x] != EMPTY) {
\r
1162 // int n = map[2*x + start] & attackMask[j];
\r
1163 // map[2*x + start] += (n < 3*one[j] ? 3*one[j] : one[j]); // first jumper gets 2 extra (to ease incremental update)
\r
1164 map[2*x + start] += one[j]; // for now use true count
\r
1175 totMob += mob * p[i].mobWeight;
\r
1177 if(!level) printf("# mobility %d = %d\n", start, totMob);
\r
1182 MapFromScratch (int *map)
\r
1185 for(i=0; i<2*bsize; i++) map[i] = 0;
\r
1186 mobilityScore = MapOneColor(1, last[WHITE], map);
\r
1187 mobilityScore -= MapOneColor(0, last[BLACK], map);
\r
1191 Connect (int sqr, int piece, int dir)
\r
1192 { // scan to both sides along ray to elongate attacks from there, and remove our own attacks on there, if needed
\r
1193 int x, step = kStep[dir], r1 = p[piece].range[dir], r2 = p[piece].range[dir+4], r3, r4, piece1, piece2;
\r
1194 int d1, d2, r, y, c;
\r
1196 if((attacks[2*sqr] + attacks[2*sqr+1]) & attackMask[dir]) { // there are incoming attack(s) from 'behind'
\r
1198 while(board[x-=step] == EMPTY); // in any case, scan to attacker, to see where / what it is
\r
1199 d1 = dist[x-sqr]; piece1 = board[x];
\r
1200 attacks[2*x + stm] -= -(d1 <= r2) & one[dir+4]; // remove our attack on it if in-range
\r
1201 if((attacks[2*sqr] + attacks[2*sqr+1]) & attackMask[dir+4]) { // there are also incoming attack(s) from 'ahead'
\r
1204 while(board[y+=step] == EMPTY); // also always scan to that one to see what it is
\r
1205 d2 = dist[y-sqr]; piece2 = board[y];
\r
1206 attacks[2*y+stm] -= -(d2 <= r1) & one[dir]; // remove our attack on it if in-range
\r
1207 // we have two pieces now shooting at each other. See how far they get.
\r
1208 if(d1 + d2 <= (r3 = p[piece1].range[dir])) { // 1 hits 2
\r
1209 attacks[2*y + (piece1 & WHITE)] += one[dir]; // count attack
\r
1210 UPDATE_MOBILITY(piece1, d2);
\r
1211 } else UPDATE_MOBILITY(piece1, r3 - d1); // does not connect, but could still gain mobility
\r
1212 if(d1 + d2 <= (r4 = p[piece2].range[dir+4])) { // 2 hits 1
\r
1213 attacks[2*x + (piece2 & WHITE)] += one[dir+4]; // count attack
\r
1214 UPDATE_MOBILITY(piece2, d1);
\r
1215 } else UPDATE_MOBILITY(piece2, r4 - d2); // does not connect, but could still gain mobility
\r
1216 // if r1 or r2<0, moves typically jump, and thus cannot be unblocked. Exceptions are FF and BS distant moves.
\r
1217 // test for d1+d2 > 2 && rN == F && d== 3 or rN == S
\r
1218 if(d1 <= 2) { // could be jump interactions
\r
1220 if(r2 <= J) attacks[2*x + stm] -= one[dir+4];
\r
1221 if(r1 <= J) attacks[2*y + stm] -= one[dir];
\r
1222 } else { // d1 == 1
\r
1223 if(r2 < J) attacks[2*x + stm] -= one[dir+4];
\r
1224 if(r1 < J) attacks[2*y + stm] -= one[dir];
\r
1225 if(board[x-step] != EMPTY && board[x-step] != EDGE)
\r
1226 attacks[2*(x-step) + stm] -= one[dir+4];
\r
1230 } else { // we were only attacked from behind
\r
1232 r = (r2 = p[piece1].range[dir]) - d1;
\r
1233 if(r < 0 || c > one[dir+4]) { // Oops! This was not our attacker, or not the only one. There must be a jump attack from even further behind!
\r
1234 // for now, forget jumpers
\r
1238 if(board[y+=step] != EMPTY) {
\r
1239 d2 = dist[y-sqr]; piece2 = board[y];
\r
1240 if(piece2 != EDGE) { // extended move hits a piece
\r
1241 attacks[2*y + (piece1 & WHITE)] += one[dir]; // count attack
\r
1242 attacks[2*y + stm] -= -(d2 <= r1) & one[dir]; // remove our own attack on it, if in-range
\r
1244 UPDATE_MOBILITY(piece1, d2); // count extra mobility even if we hit edge
\r
1247 // we hit nothing with the extended move of the attacker behind us.
\r
1248 UPDATE_MOBILITY(piece1, r2 - d1);
\r
1249 r = r1 - r2 + d1; // extra squares covered by mover
\r
1251 if(board[y+=step] != EMPTY) {
\r
1252 d2 = dist[y-sqr]; piece2 = board[y];
\r
1253 if(piece2 != EDGE) { // extended move hits a piece
\r
1254 attacks[2*y + stm] -= one[dir]; // count attack
\r
1259 // if r2<0 we should again test for F and S moves
\r
1261 } else // no incoming attack from behind
\r
1262 if(c = (attacks[2*sqr] + attacks[2*sqr+1]) & attackMask[dir+4]) { // but incoming attack(s) from 'ahead'
\r
1264 y = sqr; while(board[y+=step]); // locate attacker
\r
1265 d2 = dist[y-sqr]; piece2 = board[y];
\r
1266 attacks[2*y + stm] -= -(d2 <= r1) & one[dir]; // remove our attack on it if in-range
\r
1267 r = (r1 = p[piece1].range[dir]) - d2;
\r
1268 if(r < 0 || c > one[dir]) { // Oops! This was not our attacker, or not the only one. There must be a jump attack from even further behind!
\r
1269 // for now, forget jumpers
\r
1273 if(board[x-=step] != EMPTY) {
\r
1274 d1 = dist[x-sqr]; piece1 = board[x];
\r
1275 if(piece1 != EDGE) { // extended move hits a piece
\r
1276 attacks[2*x + (piece2 & WHITE)] += one[dir+4]; // count attack
\r
1277 attacks[2*x + stm] -= -(d1 <= r2) & one[dir+4]; // remove our own attack on it, if in-range
\r
1279 UPDATE_MOBILITY(piece2, d1); // count extra mobility even if we hit edge
\r
1282 // we hit nothing with the extended move of the attacker behind us.
\r
1283 UPDATE_MOBILITY(piece2, r2 - d1);
\r
1284 r = r2 - r1 + d2; // extra squares covered by mover
\r
1286 if(board[x-=step] != EMPTY) {
\r
1287 d1 = dist[x-sqr]; piece1 = board[x];
\r
1288 if(piece1 != EDGE) { // extended move hits a piece
\r
1289 attacks[2*x + stm] -= one[dir+4]; // count attack
\r
1294 } else { // no incoming attacks from either side. Only delete attacks of mover on others
\r
1298 if(board[x+=step] != EMPTY) { // piece found that we attacked
\r
1299 attacks[2*x + stm] -= one[dir]; // decrement attacks along that direction
\r
1305 if(board[x-=step] != EMPTY) { // piece found that we attacked
\r
1306 attacks[2*x + stm] -= one[dir+4]; // decrement attacks along opposite direction
\r
1314 Hit (int r, int d)
\r
1315 { // test if move with range r reaches over (un-obstructed) distance d
\r
1316 if(r < 0) switch(r) {
\r
1317 case J: return (d == 2);
\r
1319 case L: return (d <= 2);
\r
1321 case F: return (d <= 3);
\r
1323 default: return 0;
\r
1324 } else return (d <= r);
\r
1325 return 0; // not reached
\r
1329 Disconnect (int sqr, int piece, int dir)
\r
1331 int x = sqr, step = kStep[dir], piece1, piece2, d1, d2, r1, r2, y;
\r
1332 while( board[x+=step] == EMPTY );
\r
1333 piece1 = board[x];
\r
1334 if(piece1 != EDGE) { // x has hit a piece
\r
1336 r1 = p[piece1].range[dir+4];
\r
1337 y = sqr; while( board[y-=step] == EMPTY );
\r
1338 piece2 = board[y];
\r
1339 if(piece2 != EDGE) { // both ends of the ray hit a piece
\r
1341 r2 = p[piece2].range[dir];
\r
1342 if(r1 >= d1) { // piece1 hits us
\r
1343 attacks[2*sqr + (piece1 & WHITE)] += one[dir+4];
\r
1344 if(r1 >= d1 + d2) // was hitting piece2 before, now blocked
\r
1345 attacks[2*y + (piece1 & WHITE)] -= one[dir+4];
\r
1347 if(r2 >= d2) { // piece2 hits us
\r
1348 attacks[2*sqr + (piece2 & WHITE)] += one[dir];
\r
1349 if(r2 >= d1 + d2) // was hitting piece1 before, now blocked
\r
1350 attacks[2*x + (piece2 & WHITE)] -= one[dir];
\r
1352 if( Hit(p[piece].range[dir], d1) )
\r
1353 attacks[2*sqr + stm] += one[dir];
\r
1354 if( Hit(p[piece].range[dir+4], d2) )
\r
1355 attacks[2*sqr + stm] += one[dir+4];
\r
1359 x = sqr; while( board[x-=step] == EMPTY );
\r
1360 piece1 = board[x];
\r
1361 if(piece1 == EDGE) return; // ray empty on both sides
\r
1363 r1 = p[piece1].range[dir];
\r
1366 // we only get here if one side looks to the board edge
\r
1367 if(r1 >= d1) // piece1 hits us
\r
1368 attacks[2*sqr + (piece1 & WHITE)] += one[dir^4];
\r
1369 if( Hit(p[piece].range[dir], d1) )
\r
1370 attacks[2*sqr + stm] += one[dir];
\r
1375 { // determines attacks on square and blocking when a piece lands on an empty square
\r
1377 for(i=0; i<4; i++) {
\r
1378 Disconnect(sqr, board[sqr], i);
\r
1383 Evacuate (int sqr, int piece)
\r
1384 { // determines change in attacks on neighbors due to unblocking and mover when the mentioned piece vacates the given square
\r
1386 for(i=0; i<4; i++) Connect(sqr, piece, i);
\r
1390 MakeMove(Move m, UndoInfo *u)
\r
1392 int deferred = ABSENT;
\r
1393 // first execute move on board
\r
1394 u->from = m>>SQLEN & SQUARE;
\r
1395 u->to = m & SQUARE;
\r
1396 u->piece = board[u->from];
\r
1397 board[u->from] = EMPTY;
\r
1401 u->revMoveCount = cnt50++;
\r
1402 u->savKeyL = hashKeyL;
\r
1403 u->savKeyH = hashKeyH;
\r
1404 u->epVictim[0] = EMPTY;
\r
1405 u->saveDelta = promoDelta;
\r
1406 u->filling = filling;
\r
1408 if(p[u->piece].promoFlag & LAST_RANK) cnt50 = 0; // forward piece: move is irreversible
\r
1409 // TODO: put in some test for forward moves of non-backward pieces?
\r
1411 if(p[u->piece].value == FVAL) { // move with Fire Demon
\r
1412 int i, f=~fireFlags[u->piece-2];
\r
1413 for(i=0; i<8; i++) fireBoard[u->from + kStep[i]] &= f; // clear old burn zone
\r
1416 if(m & (PROMOTE | DEFER)) {
\r
1417 if(m & DEFER) { // essential deferral: inform caller, but nothing special
\r
1419 u->new = u->piece;
\r
1421 p[u->piece].pos = ABSENT;
\r
1422 u->new = p[u->piece].promo;
\r
1423 u->booty = p[u->new].value - p[u->piece].value;
\r
1424 cnt50 = 0; // promotion irreversible
\r
1426 } else u->new = u->piece;
\r
1428 if(u->to >= SPECIAL) { // two-step Lion move
\r
1429 // take care of first e.p. victim
\r
1430 u->epSquare = u->from + epList[u->to - SPECIAL]; // decode
\r
1431 u->epVictim[0] = board[u->epSquare]; // remember for takeback
\r
1432 board[u->epSquare] = EMPTY; // and remove
\r
1433 p[u->epVictim[0]].pos = ABSENT;
\r
1434 // now take care of (optional) second e.p. victim
\r
1435 u->ep2Square = u->from + ep2List[u->to - SPECIAL]; // This is the (already evacuated) from-square when there is none!
\r
1436 u->epVictim[1] = board[u->ep2Square]; // remember
\r
1437 board[u->ep2Square] = EMPTY; // and remove
\r
1438 p[u->epVictim[1]].pos = ABSENT;
\r
1439 // decode the true to-square, and correct difEval and hash key for the e.p. captures
\r
1440 u->to = u->from + toList[u->to - SPECIAL];
\r
1441 u->booty += p[u->epVictim[1]].value + PST[p[u->epVictim[1]].pst + u->ep2Square];
\r
1442 u->booty += p[u->epVictim[0]].value + PST[p[u->epVictim[0]].pst + u->epSquare];
\r
1443 u->gain += p[u->epVictim[1]].value;
\r
1444 u->gain += p[u->epVictim[0]].value;
\r
1445 promoDelta += p[u->epVictim[0]].promoGain;
\r
1446 promoDelta += p[u->epVictim[1]].promoGain;
\r
1447 filling -= p[u->epVictim[0]].bulk;
\r
1448 filling -= p[u->epVictim[1]].bulk;
\r
1449 hashKeyL ^= p[u->epVictim[0]].pieceKey * squareKey[u->epSquare];
\r
1450 hashKeyH ^= p[u->epVictim[0]].pieceKey * squareKey[u->epSquare+BH];
\r
1451 hashKeyL ^= p[u->epVictim[1]].pieceKey * squareKey[u->ep2Square];
\r
1452 hashKeyH ^= p[u->epVictim[1]].pieceKey * squareKey[u->ep2Square+BH];
\r
1453 if(p[u->piece].value != LVAL && p[u->epVictim[0]].value == LVAL) deferred |= PROMOTE; // flag non-Lion x Lion
\r
1454 cnt50 = 0; // double capture irreversible
\r
1457 if(u->fireMask & fireBoard[u->to]) { // we moved next to enemy Fire Demon (must be done after SPECIAL, to decode to-sqr)
\r
1458 p[u->piece].pos = ABSENT; // this is suicide: implement as promotion to EMPTY
\r
1460 u->booty -= p[u->piece].value;
\r
1463 if(p[u->piece].value == FVAL) { // move with Fire Demon that survives: burn
\r
1464 int i, f=fireFlags[u->piece-2];
\r
1465 for(i=0; i<8; i++) {
\r
1466 int x = u->to + kStep[i], burnVictim = board[x];
\r
1467 fireBoard[x] |= f; // mark new burn zone
\r
1468 u->epVictim[i+1] = burnVictim; // remember all neighbors, just in case
\r
1469 if(burnVictim != EMPTY && (burnVictim & TYPE) == xstm) { // opponent => actual burn
\r
1470 board[x] = EMPTY; // remove it
\r
1471 p[burnVictim].pos = ABSENT;
\r
1472 u->booty += p[burnVictim].value + PST[p[burnVictim].pst + x];
\r
1473 u->gain += p[burnVictim].value;
\r
1474 promoDelta += p[burnVictim].promoGain;
\r
1475 filling -= p[burnVictim].bulk;
\r
1476 hashKeyL ^= p[burnVictim].pieceKey * squareKey[x];
\r
1477 hashKeyH ^= p[burnVictim].pieceKey * squareKey[x + BH];
\r
1478 cnt50 = 0; // actually burning something makes the move irreversible
\r
1481 u->epVictim[0] = EDGE; // kludge to flag to UnMake this is special move
\r
1484 u->booty += PST[p[u->new].pst + u->to] - PST[p[u->piece].pst + u->from];
\r
1486 u->victim = board[u->to];
\r
1487 p[u->victim].pos = ABSENT;
\r
1488 filling += p[u->new].bulk - p[u->piece].bulk - p[u->victim].bulk;
\r
1489 promoDelta += p[u->new].promoGain - p[u->piece].promoGain + p[u->victim].promoGain;
\r
1490 u->booty += p[u->victim].value + PST[p[u->victim].pst + u->to];
\r
1491 u->gain += p[u->victim].value;
\r
1492 if(u->victim != EMPTY) {
\r
1493 cnt50 = 0; // capture irreversible
\r
1494 if(attacks[2*u->to + xstm]) u->loss = p[u->piece].value; // protected
\r
1497 p[u->new].pos = u->to;
\r
1498 board[u->to] = u->new;
\r
1499 promoDelta = -promoDelta;
\r
1501 hashKeyL ^= p[u->new].pieceKey * squareKey[u->to]
\r
1502 ^ p[u->piece].pieceKey * squareKey[u->from]
\r
1503 ^ p[u->victim].pieceKey * squareKey[u->to];
\r
1504 hashKeyH ^= p[u->new].pieceKey * squareKey[u->to+BH]
\r
1505 ^ p[u->piece].pieceKey * squareKey[u->from+BH]
\r
1506 ^ p[u->victim].pieceKey * squareKey[u->to+BH];
\r
1512 UnMake(UndoInfo *u)
\r
1514 if(u->epVictim[0]) { // move with side effects
\r
1515 if(u->epVictim[0] == EDGE) { // fire-demon burn
\r
1516 int i, f=~fireFlags[u->piece-2];
\r
1517 for(i=0; i<8; i++) {
\r
1518 int x = u->to + kStep[i];
\r
1519 fireBoard[x] &= f;
\r
1520 board[x] = u->epVictim[i+1];
\r
1521 p[board[x]].pos = x; // even EDGE should have dummy entry in piece list
\r
1523 } else { // put Lion victim of first leg back
\r
1524 p[u->epVictim[1]].pos = u->ep2Square;
\r
1525 board[u->ep2Square] = u->epVictim[1];
\r
1526 p[u->epVictim[0]].pos = u->epSquare;
\r
1527 board[u->epSquare] = u->epVictim[0];
\r
1531 if(p[u->piece].value == FVAL) {
\r
1532 int i, f=fireFlags[u->piece-2];
\r
1533 for(i=0; i<8; i++) fireBoard[u->from + kStep[i]] |= f; // restore old burn zone
\r
1536 p[u->victim].pos = u->to;
\r
1537 board[u->to] = u->victim; // can be EMPTY
\r
1539 p[u->new].pos = ABSENT;
\r
1540 p[u->piece].pos = u->from; // this can be the same as above
\r
1541 board[u->from] = u->piece;
\r
1543 cnt50 = u->revMoveCount;
\r
1544 hashKeyL = u->savKeyL;
\r
1545 hashKeyH = u->savKeyH;
\r
1546 filling = u->filling;
\r
1547 promoDelta = u->saveDelta;
\r
1551 GenCapts(int sqr, int victimValue)
\r
1552 { // generate all moves that capture the piece on the given square
\r
1553 int i, range, att = attacks[2*sqr + stm];
\r
1554 //printf("GenCapts(%c%d,%d) %08x\n",sqr%BW+'a',sqr/BW,victimValue,att);
\r
1555 if(!att) return; // no attackers at all!
\r
1556 for(i=0; i<8; i++) { // try all rays
\r
1557 int x, v, jumper, jcapt=0;
\r
1558 if(att & attackMask[i]) { // attacked by move in this direction
\r
1559 v = -kStep[i]; x = sqr;
\r
1560 while( board[x+=v] == EMPTY ); // scan towards source until we encounter a 'stop'
\r
1561 //printf("stop @ %c%d (dir %d)\n",x%BW+'a',x/BW,i);
\r
1562 if((board[x] & TYPE) == stm) { // stop is ours
\r
1563 int attacker = board[x], d = dist[x-sqr], r = p[attacker].range[i];
\r
1564 //printf("attacker %d, range %d, dist %d\n", attacker, r, d);
\r
1565 if(r >= d || r < L && (d > 3 && r == S || d == 3 && r >= S)) { // it has a plain move in our direction that hits us
\r
1566 NewCapture(x, sqr + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1568 if(!(att & attackMask[i])) continue; // no more; next direction
\r
1569 jcapt = p[board[x]].qval; // jump-capturer hierarchy
\r
1570 while(board[x+=v] == EMPTY);// one attack accounted for, but more to come, so skip to next stop
\r
1573 // we get here when we are on a piece that dous not attack us through a (limited) ranging move,
\r
1574 // it can be our own or an enemy with not (enough) range, or which is blocked
\r
1576 //printf("scan %x-%x (%d) dir=%d d=%d r=%d att=%o jcapt=%d qval=%d\n", sqr, x, board[x], i, dist[x-sqr], p[board[x]].range[i], att, jcapt, p[board[x]].qval);
\r
1577 if((board[x] & TYPE) == stm) { // stop is ours
\r
1578 int attacker = board[x], d = dist[x-sqr], r = p[attacker].range[i];
\r
1579 if(jcapt < p[attacker].qval) { // it is a range jumper that jumps over the barrier
\r
1580 if(p[attacker].range[i] > 1) { // assumes all jump-captures are infinite range
\r
1581 NewCapture(x, sqr, p[attacker].promoFlag);
\r
1584 //if(board[x] == EDGE) { printf("edge hit %x-%x dir=%d att=%o\n", sqr, x, i, att); continue; }
\r
1586 if(r < 0) { // stop has non-standard moves
\r
1587 switch(p[attacker].range[i]) { // figure out what he can do (including multi-captures, which causes the complexity)
\r
1588 case F: // Lion power + 3-step (as in FF)
\r
1589 case S: // Lion power + ranging (as in BS)
\r
1592 NewCapture(x, sqr + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1594 // now the multi-captures of designated victim together with lower-valued piece
\r
1595 if(d == 2) { // primary victim on second ring; look for victims to take in passing
\r
1596 if((board[sqr+v] & TYPE) == xstm && board[sqr+v] > board[sqr])
\r
1597 NewCapture(x, SPECIAL + 9*i + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1598 if((i&1) == 0) { // orthogonal: two extra bent paths
\r
1600 if((board[x+v] & TYPE) == xstm && board[x+v] > board[sqr])
\r
1601 NewCapture(x, SPECIAL + 8*(i-1&7) + (i+1&7) + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1603 if((board[x+v] & TYPE) == xstm && board[x+v] > board[sqr])
\r
1604 NewCapture(x, SPECIAL + 8*(i+1&7) + (i-1&7) + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1606 } else { // primary victim on first ring
\r
1608 for(j=0; j<8; j++) { // we can go on in 8 directions after we captured it in passing
\r
1610 if(sqr + v == x || board[sqr+v] == EMPTY) // hit & run; make sure we include igui (attacker is still at x!)
\r
1611 NewCapture(x, SPECIAL + 8*i + j + victimValue, p[attacker].promoFlag);
\r
1612 else if((board[sqr+v] & TYPE) == xstm && board[sqr+v] > board[sqr]) { // double capture
\r
1613 NewCapture(x, SPECIAL + 8*i + j + victimValue, p[attacker].promoFlag); // other victim after primary
\r
1614 if(dist[sqr+v-x] == 1) // other victim also on first ring; reverse order is possible
\r
1615 NewCapture(x, SPECIAL + reverse[8*i + j] + victimValue, p[attacker].promoFlag);
\r
1620 case D: // linear Lion move (as in HF, SE)
\r
1622 NewCapture(x, sqr + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1624 if(d == 2) { // check if we can take intermediate with it
\r
1625 if((board[x-v] & TYPE) == xstm && board[x-v] > board[sqr])
\r
1626 NewCapture(x, SPECIAL + 9*i + victimValue - SORTKEY(attacker), p[attacker].promoFlag); // e.p.
\r
1627 } else { // d=1; can move on to second, or move back for igui
\r
1628 NewCapture(x, SPECIAL + 8*i + (i^4) + victimValue, p[attacker].promoFlag); // igui
\r
1629 if(board[sqr-v] == EMPTY || (board[sqr-v] & TYPE) == xstm && board[sqr-v] > board[sqr])
\r
1630 NewCapture(x, SPECIAL + 9*i + victimValue - SORTKEY(attacker), p[attacker].promoFlag); // hit and run
\r
1633 case J: // plain jump (as in KY, PH)
\r
1635 NewCapture(x, sqr + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1638 case C: // FIDE Pawn
\r
1640 NewCapture(x, sqr + victimValue - SORTKEY(attacker), p[attacker].promoFlag);
\r
1644 //printf("mask[%d] = %o\n", i, att);
\r
1645 if((att & attackMask[i]) == 0) break;
\r
1647 // more attacks to come; san for next stop
\r
1648 if(jcapt < p[board[x]].qval) jcapt = p[board[x]].qval; // raise barrier for range jumpers further upstream
\r
1649 while(board[x+=v] == EMPTY); // this should never run off-board, if the attack map is not corrupted
\r
1653 // off-ray attacks
\r
1654 if(att & 0700000000) { // Knight attack
\r
1655 for(i=0; i<8; i++) { // scan all knight jumps to locate source
\r
1656 int x = sqr - nStep[i], attacker = board[x];
\r
1657 if(attacker == EMPTY || (attacker & TYPE) != stm) continue;
\r
1658 if(p[attacker].range[i] <= L && p[attacker].range[i] >= S || p[attacker].range[i] == N) { // has Knight jump in our direction
\r
1659 NewCapture(x, sqr + victimValue, p[attacker].promoFlag); // plain jump (as in N)
\r
1660 if(p[attacker].range[i] < N) { // Lion power; generate double captures over two possible intermediates
\r
1661 int v = kStep[i]; // leftish path
\r
1662 if((board[x+v] & TYPE) == xstm && board[x+v] > board[sqr])
\r
1663 NewCapture(x, SPECIAL + 8*i + (i+1&7) + victimValue, p[attacker].promoFlag);
\r
1664 v = kStep[i+1]; // rightish path
\r
1665 if((board[x+v] & TYPE) == xstm && board[x+v] > board[sqr])
\r
1666 NewCapture(x, SPECIAL + 8*(i+1&7) + i + victimValue, p[attacker].promoFlag);
\r
1676 int piece = board[sqr], val;
\r
1677 if(piece == EDGE) return 0;
\r
1678 val = p[piece].value;
\r
1679 if(val == 201) return 3; // Elephant
\r
1680 if(val == 152) return 2; // Tiger
\r
1681 if(val == 151) return 1; // Gold
\r
1686 Fortress (int forward, int king, int lion)
\r
1687 { // penalty for lack of Lion-proof fortress
\r
1688 int rank = PST[king], anchor, r, l, q;
\r
1689 if(!rank) return -300;
\r
1690 anchor = king + forward*(rank-1);
\r
1692 if(Guard(anchor) == 3 || Guard(anchor+1) == 3 || Guard(anchor-1) == 3) return 0;
\r
1693 if(rank == 2 && Guard(king+1) == 3 || Guard(king-1) == 3) return -50;
\r
1694 if(Guard(r=anchor) == 2 || Guard(r=anchor+1) == 2 || Guard(r=anchor-1) == 2)
\r
1695 return -100 + 50*(Guard(r + forward + 1) == 3 || Guard(r + forward - 1) == 3);
\r
1698 for(r=anchor+1; Guard(r) > 1; r++);
\r
1699 for(l=anchor-1; Guard(l) > 1; l--);
\r
1700 //if(PATH) printf("# l=%d r=%d\n", l, r);
\r
1701 if(Guard(anchor) < 2) {
\r
1702 if(r - anchor > anchor - l || // largest group, or if equal, group that contains elephant
\r
1703 r - anchor == anchor - l && Guard(r-1) == 3) l = anchor; else r = anchor;
\r
1706 case 1: q = 15; break; // no shelter at all, maximum penalty
\r
1707 case 2: if(Guard(l+1) == 3) q = 10; // single Elephant offers some shelter
\r
1708 else if(Guard(l+forward) == 3 || Guard(l+forward+2) == 3) q = 8; // better if Tiger diagonally in front of it
\r
1709 else q = 14; // singe tiger almost no help;
\r
1711 case 3: q = 5 - (Guard(l+1) == 3 || Guard(l+3) == 3); break; // pair is better if it contains Elephant
\r
1712 case 4: q = (Guard(l+2) != 3); // 3 wide: perfect, or nearly so if Elephant not in middle
\r
1715 //if(PATH) printf("# fortress %d: q=%d l=%d r=%d\n", anchor, q, l, r);
\r
1716 return (dist[lion - king] - 23)*q; // reduce by ~half if Lion very far away
\r
1722 int lion = ABSENT, king;
\r
1723 if(p[side+2].value == LVAL) lion = p[side+2].pos;
\r
1724 if(lion == ABSENT && p[side+4].value == LVAL) lion = p[side+4].pos;
\r
1725 king = p[royal[1-side]].pos; if(king == ABSENT) king = p[royal[1-side]+1].pos;
\r
1726 return lion == ABSENT ? 0 : Fortress(side ? -BW : BW, king, lion);
\r
1730 Evaluate (int difEval)
\r
1732 int wLion = ABSENT, bLion = ABSENT, wKing, bKing, score=mobilityScore, f, i, j;
\r
1734 if(p[WHITE+2].value == LVAL) wLion = p[WHITE+2].pos;
\r
1735 if(p[BLACK+2].value == LVAL) bLion = p[BLACK+2].pos;
\r
1736 if(wLion == ABSENT && p[WHITE+4].value == LVAL) wLion = p[WHITE+4].pos;
\r
1737 if(bLion == ABSENT && p[BLACK+4].value == LVAL) bLion = p[BLACK+4].pos;
\r
1740 # define lionTrap (PST + 2*BH*BW)
\r
1741 // penalty for Lion in enemy corner, when enemy Lion is nearby
\r
1742 if(wLion != ABSENT && bLion != ABSENT) { // both have a Lion
\r
1743 static int distFac[36] = { 0, 0, 10, 9, 8, 7, 5, 3, 1 };
\r
1744 score -= ( (1+9*!attacks[2*wLion+WHITE]) * lionTrap[BW*(BH-1)+BH-1-wLion]
\r
1745 - (1+9*!attacks[2*bLion+BLACK]) * lionTrap[bLion] ) * distFac[dist[wLion - bLion]];
\r
1749 // bonus if corner lances are protected by Lion-proof setup (FL + C/S)
\r
1750 if(bLion != ABSENT) {
\r
1751 if((p[board[BW+lr]].value == 320 || p[board[BW+lr]].value == 220) &&
\r
1752 p[board[ll+1]].value == 150 && p[board[ll+BW+2]].value == 100) score += 20 + 20*!p[board[ll]].range[2];
\r
1753 if((p[board[BW+lr]].value == 320 || p[board[BW+lr]].value == 220) &&
\r
1754 p[board[lr-1]].value == 150 && p[board[lr+BW-2]].value == 100) score += 20 + 20*!p[board[lr]].range[2];
\r
1756 if(wLion != ABSENT) {
\r
1757 if((p[board[ul-BW]].value == 320 || p[board[ul-BW]].value == 220) &&
\r
1758 p[board[ul+1]].value == 150 && p[board[ul-BW+2]].value == 100) score -= 20 + 20*!p[board[ul]].range[2];
\r
1759 if((p[board[ur-BW]].value == 320 || p[board[ur-BW]].value == 220) &&
\r
1760 p[board[ur-1]].value == 150 && p[board[ur-BW-2]].value == 100) score -= 20 + 20*!p[board[ur]].range[2];
\r
1766 // basic centralization in end-game (also facilitates bare-King mating)
\r
1767 wKing = p[royal[WHITE]].pos; if(wKing == ABSENT) wKing = p[royal[WHITE]+1].pos;
\r
1768 bKing = p[royal[BLACK]].pos; if(bKing == ABSENT) bKing = p[royal[BLACK]+1].pos;
\r
1769 if(filling < 32) {
\r
1770 int lead = (stm == WHITE ? difEval : -difEval);
\r
1771 score += (PST[3*BW*BH+wKing] - PST[3*BW*BH+bKing])*(32 - filling) >> 7;
\r
1772 if(lead > 100) score -= PST[3*BW*BH+bKing]*(32 - filling) >> 3; // white leads, drive black K to corner
\r
1773 if(lead < -100) score += PST[3*BW*BH+wKing]*(32 - filling) >> 3; // black leads, drive white K to corner
\r
1778 if(bLion != ABSENT) f += Fortress( BW, wKing, bLion);
\r
1779 if(wLion != ABSENT) f -= Fortress(-BW, bKing, wLion);
\r
1780 score += (filling < 96 ? f : f*(224 - filling) >> 7); // build up slowly
\r
1785 // bonus for having Kylin in late end-game, where it could promote to Lion
\r
1786 if((filling < 64) {
\r
1787 if((wLion = kylin[WHITE]) && p[wLion].pos != ABSENT)
\r
1788 score += (64 - filling)*kylinProm[wLion];
\r
1789 if((filling < 64 && (bLion = kylin[BLACK]) && p[bLion].pos != ABSENT)
\r
1790 score -= (64 - filling)*kylinProm[bLion];
\r
1795 // penalty for blocking own P or GB: 20 by slider, 10 by other, but 50 if only retreat mode is straight back
\r
1796 for(i=last[WHITE]; i > 1 && p[i].value<=50; i-=2) {
\r
1797 if((f = p[i].pos) != ABSENT && (j = board[f + BW])&1) // P present, square before it white (odd) piece
\r
1798 score -= 10 + 10*(p[j].promoGain > 0) + 30*!(p[j].range[3] || p[j].range[5] || p[j].value==50);
\r
1800 for(i=last[BLACK]; i > 1 && p[i].value<=50; i-=2) {
\r
1801 if((f = p[i].pos) != ABSENT && (j = board[f - BW]) && !(j&1)) // P present, square before non-empty and even (black)
\r
1802 score += 10 + 10*(p[j].promoGain > 0) + 30*!(p[j].range[1] || p[j].range[7] || p[j].value==50);
\r
1806 return difEval - (filling*filling*promoDelta >> 16) + (stm ? score : -score);
\r
1810 FireSet (UndoInfo *tb)
\r
1811 { // set fireFlags acording to remaining presene of Fire Demons
\r
1813 for(i=stm+2; p[i].value == FVAL; i++) // Fire Demons are always leading pieces in list
\r
1814 if(p[i].pos != ABSENT) tb->fireMask |= fireFlags[i-2];
\r
1817 void TerminationCheck();
\r
1822 Search (int alpha, int beta, int difEval, int depth, int lmr, int oldPromo, int promoSuppress, int threshold)
\r
1824 int i, j, k, phase, king, nextVictim, to, defer, autoFail=0, inCheck = 0, late=100000;
\r
1825 int firstMove, oldMSP = msp, curMove, sorted, bad, dubious, bestMoveNr;
\r
1826 int resDep, iterDep, ext;
\r
1828 int score, bestScore, oldBest, curEval, iterAlpha;
\r
1829 Move move, nullMove;
\r
1832 Move hashMove; int index, nr, hit;
\r
1834 if(PATH) /*pboard(board),pmap(attacks, BLACK),*/printf("search(%d) {%d,%d} eval=%d, stm=%d (flag=%d)\n",depth,alpha,beta,difEval,stm,abortFlag),fflush(stdout);
\r
1835 xstm = stm ^ WHITE;
\r
1836 //printf("map made\n");fflush(stdout);
\r
1838 // in-check test and TSUME filter
\r
1840 k = p[king=royal[stm]].pos;
\r
1841 if( k == ABSENT) k = p[king + 2].pos;
\r
1842 else if(p[king + 2].pos != ABSENT) k = ABSENT; // two kings is no king...
\r
1843 if( k != ABSENT) { // check is possible
\r
1844 if(!attacks[2*k + xstm]) {
\r
1845 if(tsume && tsume & stm+1) {
\r
1846 retDep = 60; return INF; // we win when not in check
\r
1850 else { inCheck = 1; if(depth >= QSdepth) depth++; }
\r
1855 if(!level) {for(i=0; i<5; i++)printf("# %d %08x, %d\n", i, repStack[200-i], checkStack[200-i]);}
\r
1857 k = p[king=royal[xstm]].pos;
\r
1858 if( k != ABSENT) {
\r
1859 if(attacks[2*k + stm]) {
\r
1860 if( p[king + 2].pos == ABSENT ) return INF; // we have an attack on his only King
\r
1862 } else { // he has no king! Test for attacks on Crown Prince
\r
1863 k = p[king + 2].pos;
\r
1864 if(attacks[2*k + stm]) return INF; // we have attack on Crown Prince
\r
1866 //printf("King safe\n");fflush(stdout);
\r
1867 // EVALUATION & WINDOW SHIFT
\r
1868 curEval = Evaluate(difEval) -20*inCheck;
\r
1869 alpha -= (alpha < curEval);
\r
1870 beta -= (beta <= curEval);
\r
1872 if(!(nodes++ & 4095)) TerminationCheck();
\r
1873 pv[pvPtr++] = 0; // start empty PV, directly behind PV of parent
\r
1874 if(inCheck) lmr = 0; else depth -= lmr; // no LMR of checking moves
\r
1876 firstMove = curMove = sorted = msp += 50; // leave 50 empty slots in front of move list
\r
1877 iterDep = -(depth == 0); tb.fireMask = phase = 0;
\r
1880 index = hashKeyL ^ 327*stm ^ (oldPromo + 987981)*(63121 + promoSuppress);
\r
1881 index = index + (index >> 16) & hashMask;
\r
1882 nr = (hashKeyL >> 30) & 3; hit = -1;
\r
1883 if(hashTable[index].lock[nr] == hashKeyH) hit = nr; else
\r
1884 if(hashTable[index].lock[4] == hashKeyH) hit = 4;
\r
1885 if(PATH) printf("# probe hash index=%x hit=%d\n", index, hit),fflush(stdout);
\r
1887 bestScore = hashTable[index].score[hit];
\r
1888 hashMove = hashTable[index].move[hit];
\r
1889 if((bestScore <= alpha || hashTable[index].flag[hit] & H_LOWER) &&
\r
1890 (bestScore >= beta || hashTable[index].flag[hit] & H_UPPER) ) {
\r
1891 iterDep = resDep = hashTable[index].depth[hit]; bestMoveNr = 0;
\r
1892 if(!level) iterDep = 0; // no hash cutoff in root
\r
1893 if(lmr && bestScore <= alpha && iterDep == depth) depth ++, lmr--; // self-deepening LMR
\r
1894 if(pvCuts && iterDep >= depth && hashMove && bestScore < beta && bestScore > alpha)
\r
1895 iterDep = depth - 1; // prevent hash cut in PV node
\r
1897 } else { // decide on replacement
\r
1898 if(depth >= hashTable[index].depth[nr] ||
\r
1899 depth+1 == hashTable[index].depth[nr] && !(nodes&3)) hit = nr; else hit = 4;
\r
1902 if(PATH) printf("# iterDep = %d score = %d move = %s\n",iterDep,bestScore,MoveToText(hashMove,0)),fflush(stdout);
\r
1905 if(depth > QSdepth && iterDep < QSdepth) iterDep = QSdepth; // full-width: start at least from 1-ply
\r
1906 if(PATH)printf("iterDep=%d\n", iterDep);
\r
1907 while(++iterDep <= depth) {
\r
1908 if(flag && depth>= 0) printf("iter %d:%d\n", depth,iterDep),fflush(stdout);
\r
1909 oldBest = bestScore;
\r
1910 iterAlpha = alpha; bestScore = -INF; bestMoveNr = 0; resDep = 60;
\r
1911 if(PATH)printf("new iter %d\n", iterDep);
\r
1912 if(depth <= QSdepth) {
\r
1913 bestScore = curEval; resDep = QSdepth;
\r
1914 if(bestScore > alpha) {
\r
1915 alpha = bestScore;
\r
1916 if(PATH)printf("stand pat %d\n", bestScore);
\r
1917 if(bestScore >= beta) goto cutoff;
\r
1920 for(curMove = firstMove; ; curMove++) { // loop over moves
\r
1921 if(flag && depth>= 0) printf("phase=%d: first/curr/last = %d / %d / %d\n", phase, firstMove, curMove, msp);fflush(stdout);
\r
1923 if(curMove >= msp) { // we ran out of moves; generate some new
\r
1924 if(PATH)printf("new moves, phase=%d\n", phase);
\r
1926 case 0: // null move
\r
1928 if(depth > QSdepth && curEval >= beta && !inCheck && filling > 10) {
\r
1929 int nullDep = depth - 3;
\r
1931 score = -Search(-beta, 1-beta, -difEval, nullDep<QSdepth ? QSdepth : nullDep, 0, promoSuppress & SQUARE, ABSENT, INF);
\r
1932 xstm = stm; stm ^= WHITE;
\r
1933 if(score >= beta) { msp = oldMSP; retDep += 3; pvPtr = myPV; return score + (score < curEval); }
\r
1934 // else depth += lmr, lmr = 0;
\r
1937 if(tenFlag) FireSet(&tb); // in tenjiku we must identify opposing Fire Demons to perform any moves
\r
1938 //if(PATH) printf("mask=%x\n",tb.fireMask),pbytes(fireBoard);
\r
1940 case 1: // hash move
\r
1943 if(hashMove && (depth > QSdepth || // must be capture in QS
\r
1944 (hashMove & SQUARE) >= SPECIAL || board[hashMove & SQUARE] != EMPTY)) {
\r
1945 moveStack[sorted = msp++] = hashMove;
\r
1949 case 2: // capture-gen init
\r
1950 nextVictim = xstm; autoFail = (depth == 0);
\r
1952 case 3: // generate captures
\r
1953 if(PATH) printf("%d:%2d:%2d next victim %d/%d\n",level,depth,iterDep,curMove,msp);
\r
1954 while(nextVictim < last[xstm]) { // more victims exist
\r
1955 int group, to = p[nextVictim += 2].pos; // take next
\r
1956 if(to == ABSENT) continue; // ignore if absent
\r
1957 if(!attacks[2*to + stm]) continue; // skip if not attacked
\r
1958 group = p[nextVictim].value; // remember value of this found victim
\r
1959 if(iterDep <= QSdepth + 1 && 2*group + curEval + 30 < alpha) { resDep = QSdepth + 1; goto cutoff; }
\r
1960 if(PATH) printf("%d:%2d:%2d group=%d, to=%c%d\n",level,depth,iterDep,group,to%BW+'a',to/BW+ONE);
\r
1962 if(PATH) printf("%d:%2d:%2d first=%d msp=%d\n",level,depth,iterDep,firstMove,msp);
\r
1963 while(nextVictim < last[xstm] && p[nextVictim+2].value == group) { // more victims of same value exist
\r
1964 to = p[nextVictim += 2].pos; // take next
\r
1965 if(to == ABSENT) continue; // ignore if absent
\r
1966 if(!attacks[2*to + stm]) continue; // skip if not attacked
\r
1967 if(PATH) printf("%d:%2d:%2d p=%d, to=%c%d\n",level,depth,iterDep,nextVictim,to%BW+'a',to/BW+ONE);
\r
1969 if(PATH) printf("%d:%2d:%2d msp=%d\n",level,depth,iterDep,msp);
\r
1971 if(PATH) printf("captures on %d generated, msp=%d, group=%d, threshold=%d\n", nextVictim, msp, group, threshold);
\r
1972 goto extractMove; // in auto-fail phase, only search if they might auto-fail-hi
\r
1974 if(PATH) printf("# autofail=%d\n", autoFail);
\r
1975 if(autoFail) { // non-captures cannot auto-fail; flush queued captures first
\r
1976 if(PATH) printf("# autofail end (%d-%d)\n", firstMove, msp);
\r
1977 autoFail = 0; curMove = firstMove - 1; continue; // release stashed moves for search
\r
1979 // if(currentVariant == V_CHESS && promoSuppress != ABSENT) { // e.p.
\r
1980 // int n = board[promoSuppress-1];
\r
1981 // if( n != EMPTY && (n&TYPE) == xstm && p[n].value == 8 )
\r
1983 phase = 4; // out of victims: all captures generated
\r
1984 case 4: // dubious captures
\r
1986 while( dubious < framePtr + 250 ) // add dubious captures back to move stack
\r
1987 moveStack[msp++] = moveStack[dubious++];
\r
1988 if(curMove != msp) break;
\r
1991 case 5: // killers
\r
1992 if(depth <= QSdepth) { if(resDep > QSdepth) resDep = QSdepth; goto cutoff; }
\r
1994 case 6: // non-captures
\r
1996 nullMove = GenNonCapts(oldPromo);
\r
1998 { // swap killers to front
\r
1999 Move h = killer[level][0]; int j = curMove;
\r
2000 for(i=curMove; i<msp; i++) if(moveStack[i] == h) { moveStack[i] = moveStack[j]; moveStack[j++] = h; break; }
\r
2001 h = killer[level][1];
\r
2002 for(i=curMove; i<msp; i++) if(moveStack[i] == h) { moveStack[i] = moveStack[j]; moveStack[j++] = h; break; }
\r
2009 sorted = msp; // do not sort noncapts
\r
2011 case 7: // bad captures
\r
2012 case 8: // PV null move
\r
2014 if(PATH) printf("# null = %0x\n", nullMove);
\r
2015 if(nullMove != ABSENT) {
\r
2016 moveStack[msp++] = nullMove + (nullMove << SQLEN) | DEFER; // kludge: setting DEFER guarantees != 0, and has no effect
\r
2019 //printf("# %d. sqr = %08x null = %08x\n", msp, nullMove, moveStack[msp-1]);
\r
2025 // MOVE EXTRACTION
\r
2027 //if(flag & depth >= 0 || (PATH)) printf("%2d:%d extract %d/%d\n", depth, iterDep, curMove, msp);
\r
2028 if(curMove > sorted) {
\r
2029 move = moveStack[sorted=j=curMove];
\r
2030 for(i=curMove+1; i<msp; i++)
\r
2031 if(moveStack[i] > move) move = moveStack[j=i]; // search move with highest priority
\r
2032 moveStack[j] = moveStack[curMove]; moveStack[curMove] = move; // swap highest-priority move to front of remaining
\r
2033 if(move == 0) { msp = curMove--; continue; } // all remaining moves must be 0; clip off move list
\r
2035 move = moveStack[curMove];
\r
2036 if(move == 0) continue; // skip invalidated move
\r
2038 if(flag & depth >= 0) printf("%2d:%d found %d/%d %08x %s\n", depth, iterDep, curMove, msp, moveStack[curMove], MoveToText(moveStack[curMove], 0));
\r
2042 defer = MakeMove(move, &tb);
\r
2043 ext = (depth == 0); // when out of depth we extend captures if there was no auto-fail-hi
\r
2045 // if(level == 1 && randomize) tb.booty += (hashKeyH * seed >> 24 & 31) - 20;
\r
2048 UnMake(&tb); // never search moves during auto-fail phase
\r
2049 xstm = stm; stm ^= WHITE;
\r
2050 if(tb.gain <= threshold) { // we got to moves that cannot possibly auto-fail
\r
2051 autoFail = 0; curMove = firstMove-1; continue; // release all for search
\r
2053 if(tb.gain - tb.loss > threshold) {
\r
2054 bestScore = INF+1; resDep = 0; goto leave; // auto-fail-hi
\r
2055 } else continue; // ignore for now if not obvious refutation
\r
2058 if(flag & depth >= 0) printf("%2d:%d made %d/%d %s\n", depth, iterDep, curMove, msp, MoveToText(moveStack[curMove], 0));
\r
2059 for(i=2; i<=cnt50; i+=2) if(repStack[level-i+200] == hashKeyH) {
\r
2060 if(repDraws) { score = 0; goto repetition; }
\r
2062 moveStack[curMove] = 0; // erase forbidden move
\r
2063 if(!level) repeatMove[repCnt++] = move & 0xFFFFFF; // remember outlawed move
\r
2064 } else { // check for perpetuals
\r
2065 // int repKey = 1;
\r
2066 // for(i-=level; i>1; i-=2) {repKey &= checkStack[200-i]; if(!level)printf("# repkey[%d] = %d\n", 200-i, repKey);}
\r
2067 if(inCheck) { score = INF-20; goto repetition; } // we might be subject to perpetual check: score as win
\r
2068 if(i == 2 && repStack[level+199] == hashKeyH) { score = INF-20; goto repetition; } // consecutive passing
\r
2070 score = -INF + 8*allowRep; goto repetition;
\r
2072 repStack[level+200] = hashKeyH;
\r
2074 if(PATH) printf("%d:%2d:%d %3d %6x %-10s %6d %6d\n", level, depth, iterDep, curMove, moveStack[curMove], MoveToText(moveStack[curMove], 0), score, bestScore),fflush(stdout);
\r
2075 path[level++] = move;
\r
2076 attacks += 2*bsize;
\r
2077 MapFromScratch(attacks); // for as long as incremental update does not work.
\r
2078 //if(flag & depth >= 0) printf("%2d:%d mapped %d/%d %s\n", depth, iterDep, curMove, msp, MoveToText(moveStack[curMove], 0));
\r
2079 //if(PATH) pmap(attacks, stm);
\r
2080 if(chuFlag && p[tb.victim].value == LVAL) {// verify legality of Lion capture in Chu Shogi
\r
2082 if(p[tb.piece].value == LVAL) { // Ln x Ln: can make Ln 'vulnerable' (if distant and not through intemediate > GB)
\r
2083 if(dist[tb.from-tb.to] != 1 && attacks[2*tb.to + stm] && p[tb.epVictim[0]].value <= 50)
\r
2084 score = -INF; // our Lion is indeed made vulnerable and can be recaptured
\r
2085 } else { // other x Ln
\r
2086 if(promoSuppress & PROMOTE) score = -INF; // non-Lion captures Lion after opponent did same
\r
2087 defer |= PROMOTE; // if we started, flag he cannot do it in reply
\r
2089 if(score == -INF) {
\r
2090 if(level == 1) repeatMove[repCnt++] = move & 0xFFFFFF | (p[tb.piece].value == LVAL ? 3<<24 : 1 << 24);
\r
2091 moveStack[curMove] = 0; // zap illegal moves
\r
2096 score = -Search(-beta, -iterAlpha, -difEval - tb.booty, iterDep-1+ext,
\r
2097 curMove >= late && iterDep > QSdepth + LMR,
\r
2098 promoSuppress & ~PROMOTE, defer, depth ? INF : tb.gain);
\r
2103 attacks -= 2*bsize;
\r
2107 xstm = stm; stm ^= WHITE;
\r
2108 if(abortFlag > 0) { // unwind search
\r
2109 printf("# abort (%d) @ %d\n", abortFlag, level);
\r
2110 if(curMove == firstMove) bestScore = oldBest, bestMoveNr = firstMove; // none searched yet
\r
2114 if(PATH) printf("%d:%2d:%d %3d %6x %-10s %6d %6d (%d)\n", level, depth, iterDep, curMove, moveStack[curMove], MoveToText(moveStack[curMove], 0), score, bestScore, GetTickCount()),fflush(stdout);
\r
2116 // ALPHA-BETA STUFF
\r
2117 if(score > bestScore) {
\r
2118 bestScore = score; bestMoveNr = curMove;
\r
2119 if(score > iterAlpha) {
\r
2120 iterAlpha = score;
\r
2121 if(curMove < firstMove + 5) { // if not too much work, sort move to front
\r
2123 for(i=curMove; i>firstMove; i--) {
\r
2124 moveStack[i] = moveStack[i-1];
\r
2126 moveStack[firstMove] = move;
\r
2127 } else { // late move appended in front of list, and leaves hole in list
\r
2128 moveStack[--firstMove] = move;
\r
2129 moveStack[curMove] = 0;
\r
2131 bestMoveNr = firstMove;
\r
2132 if(score >= beta) { // beta cutoff
\r
2134 if(iterDep == depth && move != killer[level][0]
\r
2135 && (tb.victim == EMPTY && (move & SQUARE) < SPECIAL)) {
\r
2137 killer[level][1] = killer[level][0]; killer[level][0] = move;
\r
2140 resDep = retDep+1-ext;
\r
2144 for(pvPtr = myPV+1; pv[pvPtr++] = pv[i++]; ); // copy daughter PV
\r
2145 pv[myPV] = move; // behind our move (pvPtr left at end of copy)
\r
2150 if(retDep+1-ext < resDep) resDep = retDep+1-ext;
\r
2154 if(!level) { // root node
\r
2155 lastRootIter = GetTickCount() - startTime;
\r
2156 if(postThinking > 0) {
\r
2157 int i; // WB thinking output
\r
2158 printf("%d %d %d %d", iterDep-QSdepth, bestScore, lastRootIter/10, nodes);
\r
2159 if(ponderMove) printf(" (%s)", MoveToText(ponderMove, 0));
\r
2160 for(i=0; pv[i]; i++) printf(" %s", MoveToText(pv[i], 0));
\r
2161 if(iterDep == QSdepth+1) printf(" { root eval = %4.2f dif = %4.2f; abs = %4.2f f=%d D=%4.2f %d/%d}", curEval/100., difEval/100., PSTest()/100., filling, promoDelta/100., Ftest(0), Ftest(1));
\r
2165 if(!(abortFlag & 1) && GetTickCount() - startTime > tlim1) break; // do not start iteration we can (most likely) not finish
\r
2167 if(resDep > iterDep) iterDep = resDep; // skip iterations if we got them for free
\r
2169 if(lmr && bestScore <= alpha && iterDep == depth)
\r
2170 depth++, lmr--; // self-deepen on fail-low reply to late move by lowering reduction
\r
2174 hashTable[index].lock[hit] = hashKeyH;
\r
2175 hashTable[index].depth[hit] = iterDep;
\r
2176 hashTable[index].score[hit] = bestScore;
\r
2177 hashTable[index].flag[hit] = (bestScore < beta) * H_UPPER;
\r
2178 if(bestScore > alpha) {
\r
2179 hashTable[index].flag[hit] |= H_LOWER;
\r
2180 hashTable[index].move[hit] = bestMoveNr ? moveStack[bestMoveNr] : 0;
\r
2181 } else hashTable[index].move[hit] = 0;
\r
2186 retFirst = firstMove;
\r
2187 msp = oldMSP; // pop move list
\r
2188 pvPtr = myPV; // pop PV
\r
2189 retMove = bestMoveNr ? moveStack[bestMoveNr] : 0;
\r
2190 retDep = resDep - (inCheck & depth >= QSdepth) + lmr;
\r
2191 if(PATH) printf("return %d: %d %d (t=%d s=%d lim=%d)\n", depth, bestScore, curEval, GetTickCount(), startTime, tlim1),fflush(stdout);
\r
2192 return bestScore + (bestScore < curEval);
\r
2199 for(i=0; i<182; i++) {
\r
2200 printf("%3d. %3d %3d %4d %02x %d %d %x %3d ", i, p[i].value, p[i].promo, p[i].pos, p[i].promoFlag&255, p[i].mobWeight, p[i].qval, p[i].bulk, p[i].promoGain);
\r
2201 for(j=0; j<8; j++) printf(" %2d", p[i].range[j]);
\r
2202 if(i<2 || i>11) printf("\n"); else printf(" %02x\n", fireFlags[i-2]&255);
\r
2204 printf("last: %d / %d\nroyal %d / %d\n", last[WHITE], last[BLACK], royal[WHITE], royal[BLACK]);
\r
2211 for(i=BH+2; i>-4; i--) {
\r
2213 for(j=-3; j<BH+3; j++) printf("%4d", b[BW*i+j]);
\r
2219 pbytes (unsigned char *b)
\r
2222 for(i=BH-1; i>=0; i--) {
\r
2223 for(j=0; j<BH; j++) printf("%3x", b[BW*i+j]);
\r
2229 pmap (int *m, int col)
\r
2232 for(i=BH-1; i>=0; i--) {
\r
2234 for(j=0; j<BH; j++) printf("%10o", m[2*(BW*i+j)+col]);
\r
2240 pmoves(int start, int end)
\r
2243 printf("# move stack from %d to %d\n", start, end);
\r
2244 for(i=start; i<end; i++) {
\r
2246 f = m>>SQLEN & SQUARE;
\r
2248 printf("# %3d. %08x %3d-%3d %s\n", i, m, f, t, MoveToText(m, 0));
\r
2252 /********************************************************/
\r
2253 /* Example of a WinBoard-protocol driver, by H.G.Muller */
\r
2254 /********************************************************/
\r
2256 #include <stdio.h>
\r
2258 // four different constants, with values for WHITE and BLACK that suit your engine
\r
2262 // some value that cannot occur as a valid move
\r
2265 // some parameter of your engine
\r
2266 #define MAXMOVES 2000 /* maximum game length */
\r
2267 #define MAXPLY 30 /* maximum search depth */
\r
2272 typedef Move MOVE;
\r
2274 int moveNr; // part of game state; incremented by MakeMove
\r
2275 MOVE gameMove[MAXMOVES]; // holds the game history
\r
2277 // Some routines your engine should have to do the various essential things
\r
2278 int MakeMove2(int stm, MOVE move); // performs move, and returns new side to move
\r
2279 void UnMake2(MOVE move); // unmakes the move;
\r
2280 int Setup2(char *fen); // sets up the position from the given FEN, and returns the new side to move
\r
2281 void SetMemorySize(int n); // if n is different from last time, resize all tables to make memory usage below n MB
\r
2282 char *MoveToText(MOVE move, int m); // converts the move from your internal format to text like e2e2, e1g1, a7a8q.
\r
2283 MOVE ParseMove(char *moveText); // converts a long-algebraic text move to your internal move format
\r
2284 int SearchBestMove(MOVE *move, MOVE *ponderMove);
\r
2285 void PonderUntilInput(int stm); // Search current position for stm, deepening forever until there is input.
\r
2287 UndoInfo undoInfo;
\r
2288 int sup0, sup1, sup2; // promo suppression squares
\r
2289 int lastLift, lastPut;
\r
2294 int k = p[royal[stm]].pos;
\r
2295 if( k == ABSENT) k = p[royal[stm] + 2].pos;
\r
2296 else if(p[royal[stm] + 2].pos != ABSENT) k = ABSENT; // two kings is no king...
\r
2297 if( k != ABSENT) {
\r
2298 MapFromScratch(attacks);
\r
2299 if(attacks[2*k + 1 - stm]) return 1;
\r
2305 MakeMove2 (int stm, MOVE move)
\r
2307 int i, inCheck = InCheck();
\r
2308 FireSet(&undoInfo);
\r
2309 sup0 = sup1; sup1 = sup2;
\r
2310 sup2 = MakeMove(move, &undoInfo);
\r
2311 if(chuFlag && p[undoInfo.victim].value == LVAL && p[undoInfo.piece].value != LVAL) sup2 |= PROMOTE;
\r
2312 rootEval = -rootEval - undoInfo.booty;
\r
2313 for(i=0; i<200; i++) repStack[i] = repStack[i+1], checkStack[i] = checkStack[i+1];
\r
2314 repStack[199] = hashKeyH, checkStack[199] = inCheck;
\r
2315 printf("# makemove %08x %c%d %c%d\n", move, sup1%BW+'a', sup1/BW, sup2%BW+'a', sup2/BW);
\r
2316 return stm ^ WHITE;
\r
2320 UnMake2 (MOVE move)
\r
2323 rootEval = -rootEval - undoInfo.booty;
\r
2324 UnMake(&undoInfo);
\r
2325 for(i=200; i>0; i--) repStack[i] = repStack[i-1], checkStack[i] = checkStack[i-1];
\r
2326 sup2 = sup1; sup1 = sup0;
\r
2329 char fenNames[] = "RV....DKDEFL..DHGB......SMLNKN..FK....BT..VM..PH...."; // pairs of char
\r
2330 char fenPromo[] = "WLDHSMSECPB R HFDE....WHFB..LNG ..DKVMFS..FO..FK...."; // pairs of char
\r
2333 Convert (char *fen)
\r
2335 char *p = fenArray, *q, *rows[36], tmp[4000];
\r
2337 printf("# convert FEN '%s'\n", fen);
\r
2338 q = strchr(fen, ' '); if(q) *q = 0; q = fen;
\r
2339 do { rows[n++] = q; q = strchr(q, '/'); if(!q) break; *q++ = 0; } while(1);
\r
2341 while(--n >= 0) { strcat(tmp, rows[n]); if(n) strcat(tmp, "/"); }
\r
2343 printf("# flipped FEN '%s'\n", fen);
\r
2345 if(*fen == ' ') { *p = 0; break; }
\r
2346 if(n=atoi(fen)) fen++; // digits read
\r
2347 if(n > 9) fen++; // double digit
\r
2348 while(n-- > 0) *p++ = '.'; // expand to empty squares
\r
2349 if(isalpha(*fen)) {
\r
2350 char *table = fenNames;
\r
2351 n = *fen > 'Z' ? 'a' - 'A' : 0;
\r
2352 if((currentVariant == V_CHESS || currentVariant == V_SHATRANJ ||
\r
2353 currentVariant == V_MAKRUK || currentVariant == V_SHO) && *fen - n == 'N' // In Chess N is Knight, not Lion
\r
2354 || table[2* (*fen - 'A' - n)] == '.') *p++ = *fen; else {
\r
2356 *p++ = table[2* (*fen - 'A' - n)] + n;
\r
2357 *p++ = table[2* (*fen - 'A' - n)+1] + n;
\r
2359 } else *p++ = *fen;
\r
2362 printf("# converted FEN '%s'\n", fenArray);
\r
2367 Setup2 (char *fen)
\r
2371 char *q = strchr(fen, '\n');
\r
2373 if(q = strchr(fen, ' ')) stm = (q[1] == 'b' ? BLACK : WHITE); // fen contains color field
\r
2374 if(strchr(fen, '.') || strchr(fen, ':')) array = fen; else array = Convert(fen);
\r
2376 rootEval = promoDelta = filling = cnt50 = moveNr = 0;
\r
2377 SetUp(array, currentVariant);
\r
2378 strcpy(startPos, array);
\r
2379 sup0 = sup1 = sup2 = ABSENT;
\r
2380 hashKeyH = hashKeyL = 87620895*currentVariant;
\r
2385 SetMemorySize (int n)
\r
2388 static HashBucket *realHash;
\r
2389 static intptr_t oldSize;
\r
2390 intptr_t l, m = 1;
\r
2391 while(m*sizeof(HashBucket) <= n*512UL) m <<= 1; // take largest power-of-2 that fits
\r
2392 if(m != oldSize) {
\r
2393 if(oldSize) free(realHash);
\r
2394 hashMask = m*1024 - 1; oldSize = m;
\r
2395 realHash = malloc(m*1024*sizeof(HashBucket) + 64);
\r
2396 l = (intptr_t) realHash; hashTable = (HashBucket*) (l & ~63UL); // align with cache line
\r
2402 MoveToText (MOVE move, int multiLine)
\r
2404 static char buf[50];
\r
2405 int f = move>>SQLEN & SQUARE, g = f, t = move & SQUARE;
\r
2406 char *promoChar = "";
\r
2407 if(f == t) { sprintf(buf, "@@@@"); return buf; } // null-move notation in WB protocol
\r
2409 if(t >= SPECIAL) { // kludgy! Print as side effect non-standard WB command to remove victims from double-capture (breaks hint command!)
\r
2410 int e = f + epList[t - SPECIAL];
\r
2411 // printf("take %c%d\n", e%BW+'a', e/BW+ONE);
\r
2412 sprintf(buf, "%c%d%c%d,", f%BW+'a', f/BW+ONE, e%BW+'a', e/BW+ONE); f = e;
\r
2413 if(multiLine) printf("move %s\n", buf), buf[0] = '\0';
\r
2414 if(ep2List[t - SPECIAL]) {
\r
2415 e = g + ep2List[t - SPECIAL];
\r
2416 // printf("take %c%d\n", e%BW+'a', e/BW+ONE);
\r
2417 sprintf(buf+strlen(buf), "%c%d%c%d,", f%BW+'a', f/BW+ONE, e%BW+'a', e/BW+ONE); f = e;
\r
2418 if(multiLine) printf("move %s\n", buf), buf[0] = '\0';
\r
2420 t = g + toList[t - SPECIAL];
\r
2422 if(move & PROMOTE) promoChar = currentVariant == V_MAKRUK ? "m" : repDraws ? "q" : "+";
\r
2423 sprintf(buf+strlen(buf), "%c%d%c%d%s", f%BW+'a', f/BW+ONE, t%BW+'a', t/BW+ONE, promoChar);
\r
2428 ReadSquare (char *p, int *sqr)
\r
2432 r = atoi(p + 1) - ONE;
\r
2434 return 2 + (r + ONE > 9);
\r
2437 int listStart, listEnd;
\r
2438 char boardCopy[BSIZE];
\r
2442 { // create move list on move stack
\r
2444 for(i=0; i< BSIZE; i++) boardCopy[i] = !!board[i];
\r
2445 MapFromScratch(attacks);
\r
2446 postThinking--; repCnt = 0; tlim1 = tlim2 = tlim3 = 1e8; abortFlag = msp = 0;
\r
2447 Search(-INF-1, INF+1, 0, QSdepth+1, 0, sup1 & ~PROMOTE, sup2, INF);
\r
2449 listStart = retFirst; listEnd = msp = retMSP;
\r
2453 ParseMove (char *moveText)
\r
2455 int i, j, f, t, t2, e, ret, deferred=0;
\r
2456 char c = moveText[0];
\r
2457 moveText += ReadSquare(moveText, &f);
\r
2458 moveText += ReadSquare(moveText, &t); t2 = t;
\r
2459 if(*moveText == ',') {
\r
2461 moveText += ReadSquare(moveText, &e);
\r
2462 if(e != t) return INVALID; // must continue with same piece
\r
2464 moveText += ReadSquare(moveText, &t);
\r
2465 for(i=0; i<8; i++) if(f + kStep[i] == e) break;
\r
2466 if(i >= 8) return INVALID; // this rejects Lion Dog 2+1 and 2-1 moves!
\r
2467 for(j=0; j<8; j++) if(e + kStep[j] == t) break;
\r
2468 if(j >= 8) return INVALID; // this rejects Lion Dog 1+2 moves!
\r
2469 t2 = SPECIAL + 8*i + j;
\r
2471 ret = f<<SQLEN | t2;
\r
2472 if(*moveText != '\n' && *moveText != '=') ret |= PROMOTE;
\r
2473 printf("# suppress = %c%d\n", sup1%BW+'a', sup1/BW);
\r
2475 for(i=listStart; i<listEnd; i++) {
\r
2476 if(moveStack[i] == INVALID) continue;
\r
2477 if(c == '@' && (moveStack[i] & SQUARE) == (moveStack[i] >> SQLEN & SQUARE)) break; // any null move matches @@@@
\r
2478 if((moveStack[i] & (PROMOTE | DEFER-1)) == ret) break;
\r
2479 if((moveStack[i] & DEFER-1) == ret) deferred = i; // promoted version of entered non-promotion is legal
\r
2481 printf("# moveNr = %d in {%d,%d}\n", i, listStart, listEnd);
\r
2482 if(i>=listEnd) { // no exact match
\r
2483 if(deferred) { // but maybe non-sensical deferral
\r
2484 int flags = p[board[f]].promoFlag;
\r
2485 printf("# deferral of %d\n", deferred);
\r
2486 i = deferred; // in any case we take that move
\r
2487 if(!(flags & promoBoard[t] & (CANT_DEFER | LAST_RANK))) { // but change it into a deferral if that is allowed
\r
2488 moveStack[i] &= ~PROMOTE;
\r
2489 if(p[board[f]].value == 40) p[board[f]].promoFlag &= LAST_RANK; else
\r
2490 if(!(flags & promoBoard[f])) moveStack[i] |= DEFER; // came from outside zone, so essential deferral
\r
2493 if(i >= listEnd) {
\r
2494 for(i=listStart; i<listEnd; i++) printf("# %d. %08x %08x %s\n", i-50, moveStack[i], ret, MoveToText(moveStack[i], 0));
\r
2496 for(i=0; i<repCnt; i++) {if((repeatMove[i] & 0xFFFFFF) == ret) {
\r
2497 if(repeatMove[i] & 1<<24) reason = (repeatMove[i] & 1<<25 ? "Distant capture of protected Lion" : "Counterstrike against Lion");
\r
2498 else reason = "Repeats earlier position";
\r
2501 printf("# %d. %08x %08x %s\n", i, repeatMove[i], ret, MoveToText(repeatMove[i], 0));
\r
2505 return (i >= listEnd ? INVALID : moveStack[i]);
\r
2509 Highlight(char *coords)
\r
2511 int i, j, n, sqr, cnt=0;
\r
2512 char b[BSIZE], buf[2000], *q;
\r
2513 for(i=0; i<bsize; i++) b[i] = 0;
\r
2514 ReadSquare(coords, &sqr);
\r
2516 for(i=listStart; i<listEnd; i++) {
\r
2517 if(sqr == (moveStack[i]>>SQLEN & SQUARE)) {
\r
2518 int t = moveStack[i] & SQUARE;
\r
2519 if(t >= SPECIAL) {
\r
2520 int e = sqr + epList[t - SPECIAL]; // decode
\r
2524 if(!b[t]) b[t] = (!boardCopy[t] ? 'Y' : 'R'); cnt++;
\r
2525 if(moveStack[i] & PROMOTE) b[t] = 'M';
\r
2528 if(!cnt) { // no moves from given square
\r
2529 if(sqr != lastPut) return; // refrain from sending empty FEN
\r
2530 // we lifted a piece for second leg of move
\r
2531 for(i=listStart; i<listEnd; i++) {
\r
2532 if(lastLift == (moveStack[i]>>SQLEN & SQUARE)) {
\r
2533 int e, t = moveStack[i] & SQUARE;
\r
2534 if(t < SPECIAL) continue; // only special moves
\r
2535 e = lastLift + epList[t - SPECIAL]; // decode
\r
2536 t = lastLift + toList[t - SPECIAL];
\r
2537 if(e != sqr) continue;
\r
2538 b[t] = (!boardCopy[t] ? 'Y' : 'R'); cnt++;
\r
2542 } else lastLift = sqr; // remember
\r
2545 for(i=BH-1; i>=0; i--) {
\r
2546 for(j=0; j<BH; j++) {
\r
2548 if(b[n]) *q++ = b[n]; else {
\r
2549 if(q > buf && q[-1] <= '9' && q[-1] >= '0') {
\r
2552 if(q > buf+1 && q[-2] <= '9' && q[-2] >= '0') q[-2]++; else q[-1] = '1', *q++ = '0';
\r
2554 } else *q++ = '1';
\r
2560 printf("highlight %s\n", buf);
\r
2563 int timeLeft; // timeleft on engine's clock
\r
2564 int mps, timeControl, inc, timePerMove; // time-control parameters, to be used by Search
\r
2565 char inBuf[8000], command[80], ponderMoveText[20];
\r
2568 SetSearchTimes (int timeLeft)
\r
2570 int targetTime, movesLeft = BW*BH/4 + 20;
\r
2571 if(mps) movesLeft = mps - (moveNr>>1)%mps;
\r
2572 targetTime = (timeLeft - 1000*inc) / (movesLeft + 2) + 1000 * inc;
\r
2573 if(moveNr < 30) targetTime *= 0.5 + moveNr/60.; // speedup in opening
\r
2574 if(timePerMove > 0) targetTime = 0.4*timeLeft, movesLeft = 1;
\r
2575 tlim1 = 0.4*targetTime;
\r
2576 tlim2 = 2.4*targetTime;
\r
2577 tlim3 = 5*timeLeft / (movesLeft + 4.1);
\r
2578 printf("# limits %d, %d, %d mode = %d\n", tlim1, tlim2, tlim3, abortFlag);
\r
2582 SearchBestMove (MOVE *move, MOVE *ponderMove)
\r
2585 printf("# SearchBestMove\n");
\r
2586 startTime = GetTickCount();
\r
2588 printf("# s=%d\n", startTime);fflush(stdout);
\r
2589 MapFromScratch(attacks);
\r
2590 retMove = INVALID; repCnt = 0;
\r
2591 score = Search(-INF-1, INF+1, rootEval, maxDepth, 0, sup1, sup2, INF);
\r
2593 *ponderMove = pv[1];
\r
2594 printf("# best=%s\n", MoveToText(pv[0],0));
\r
2595 printf("# ponder=%s\n", MoveToText(pv[1],0));
\r
2600 int TakeBack(int n)
\r
2601 { // reset the game and then replay it to the desired point
\r
2603 last = moveNr - n; if(last < 0) last = 0;
\r
2604 Init(currentVariant); stm = Setup2(startPos);
\r
2605 printf("# setup done");fflush(stdout);
\r
2606 for(moveNr=0; moveNr<last; moveNr++) stm = MakeMove2(stm, gameMove[moveNr]),printf("make %2d: %x\n", moveNr, gameMove[moveNr]);
\r
2610 void PrintResult(int stm, int score)
\r
2613 if(reason) sprintf(tail, " {%s}", reason); else *tail = 0;
\r
2614 if(score == 0) printf("1/2-1/2%s\n", tail);
\r
2615 if(score > 0 && stm == WHITE || score < 0 && stm == BLACK) printf("1-0%s\n", tail);
\r
2616 else printf("0-1%s\n", tail);
\r
2619 void GetLine(int root)
\r
2623 // wait for input, and read it until we have collected a complete line
\r
2624 for(i = 0; (inBuf[i] = c = getchar()) != '\n'; i++) if(c == EOF || i>7997) exit(0);
\r
2627 // extract the first word
\r
2628 sscanf(inBuf, "%s", command);
\r
2629 printf("# in (mode = %d,%d): %s\n", root, abortFlag, command);
\r
2630 if(!strcmp(command, "otim")) { continue; } // do not start pondering after receiving time commands, as move will follow immediately
\r
2631 if(!strcmp(command, "time")) { sscanf(inBuf, "time %d", &timeLeft); continue; }
\r
2632 if(!strcmp(command, "put")) { ReadSquare(inBuf+4, &lastPut); continue; } // ditto
\r
2633 if(!strcmp(command, ".")) { inBuf[0] = 0; return; } // ignore for now
\r
2634 if(!strcmp(command, "hover")) { inBuf[0] = 0; return; } // ignore for now
\r
2635 if(!strcmp(command, "lift")) { inBuf[0] = 0; Highlight(inBuf+5); return; } // treat here
\r
2636 if(!root && !strcmp(command, "usermove")) {
\r
2637 printf("# move = %s#ponder = %s", inBuf+9, ponderMoveText);
\r
2638 abortFlag = !!strcmp(inBuf+9, ponderMoveText);
\r
2639 if(!abortFlag) { // ponder hit, continue as time-based search
\r
2640 printf("# ponder hit\n");
\r
2641 SetSearchTimes(10*timeLeft + GetTickCount() - startTime); // add time we already have been pondering to total
\r
2642 if(lastRootIter > tlim1) abortFlag = 2; // abort instantly if we are in iteration we should not have started
\r
2643 inBuf[0] = 0; ponderMove = INVALID;
\r
2653 TerminationCheck()
\r
2655 if(abortFlag < 0) { // check for input
\r
2656 if(InputWaiting()) GetLine(0); // read & examine input command
\r
2657 } else { // check for time
\r
2658 if(GetTickCount() - startTime > tlim3) abortFlag = 2;
\r
2664 int engineSide=NONE; // side played by engine
\r
2666 int i, score, curVarNr;
\r
2668 Init(V_CHU); // Chu
\r
2669 seed = startTime = GetTickCount(); moveNr = 0; // initialize random
\r
2671 while(1) { // infinite loop
\r
2673 fflush(stdout); // make sure everything is printed before we do something that might take time
\r
2674 *inBuf = 0; if(moveNr >= 20) randomize = OFF;
\r
2675 //if(moveNr >20) printf("resign\n");
\r
2680 if(listEnd == 0) ListMoves(); // always maintain a list of legal moves in root position
\r
2681 abortFlag = -(ponder && WHITE+BLACK-stm == engineSide && moveNr); // pondering and opponent on move
\r
2682 if(stm == engineSide || abortFlag && ponderMove) { // if it is the engine's turn to move, set it thinking, and let it move
\r
2683 printf("# start search: stm=%d engine=%d (flag=%d)\n", stm, engineSide, abortFlag);
\r
2685 stm = MakeMove2(stm, ponderMove); // for pondering, play speculative move
\r
2686 gameMove[moveNr++] = ponderMove; // remember in game
\r
2687 sprintf(ponderMoveText, "%s\n", MoveToText(ponderMove, 0)); // for detecting ponder hits
\r
2688 printf("# ponder move = %s", ponderMoveText);
\r
2689 } else SetSearchTimes(10*timeLeft); // for thinking, schedule end time
\r
2691 score = SearchBestMove(&move, &ponderMove);
\r
2692 if(abortFlag == 1) { // ponder search was interrupted (and no hit)
\r
2693 UnMake2(INVALID); moveNr--; stm ^= WHITE; // take ponder move back if we made one
\r
2696 if(move == INVALID) { // game apparently ended
\r
2697 int kcapt = 0, xstm = stm ^ WHITE, king, k = p[king=royal[xstm]].pos;
\r
2698 if( k != ABSENT) { // test if King capture possible
\r
2699 if(attacks[2*k + stm]) {
\r
2700 if( p[king + 2].pos == ABSENT ) kcapt = 1; // we have an attack on his only King
\r
2702 } else { // he has no king! Test for attacks on Crown Prince
\r
2703 k = p[king + 2].pos;
\r
2704 if(attacks[2*k + stm]) kcapt = 1; // we have attack on Crown Prince
\r
2706 if(kcapt) { // print King capture before claiming
\r
2708 printf("move %s\n", MoveToText(moveStack[msp-1], 1));
\r
2709 reason = "king capture";
\r
2710 } else reason = "resign";
\r
2711 engineSide = NONE; // so stop playing
\r
2712 PrintResult(stm, score);
\r
2714 stm = MakeMove2(stm, move); // assumes MakeMove returns new side to move
\r
2715 gameMove[moveNr++] = move; // remember game
\r
2716 printf("move %s\n", MoveToText(move, 1));
\r
2718 continue; // go check if we should ponder
\r
2721 if(engineSide == ANALYZE || abortFlag) { // in analysis, we always ponder the position
\r
2723 *ponderMoveText = 0; // forces miss on any move
\r
2724 abortFlag = -1; // set pondering
\r
2726 SearchBestMove(&dummy, &dummy);
\r
2727 abortFlag = pvCuts = 0;
\r
2730 fflush(stdout); // make sure everything is printed before we do something that might take time
\r
2731 if(!*inBuf) GetLine(1); // takes care of time and otim commands
\r
2733 // recognize the command,and execute it
\r
2734 if(!strcmp(command, "quit")) { break; } // breaks out of infinite loop
\r
2735 if(!strcmp(command, "force")) { engineSide = NONE; continue; }
\r
2736 if(!strcmp(command, "analyze")) { engineSide = ANALYZE; continue; }
\r
2737 if(!strcmp(command, "exit")) { engineSide = NONE; continue; }
\r
2738 if(!strcmp(command, "level")) {
\r
2740 sscanf(inBuf, "level %d %d %d", &mps, &min, &inc) == 3 || // if this does not work, it must be min:sec format
\r
2741 sscanf(inBuf, "level %d %d:%d %d", &mps, &min, &sec, &inc);
\r
2742 timeControl = 60*min + sec; timePerMove = -1;
\r
2745 if(!strcmp(command, "protover")){
\r
2746 printf("feature ping=1 setboard=1 colors=0 usermove=1 memory=1 debug=1 sigint=0 sigterm=0\n");
\r
2747 printf("feature variants=\"normal,shatranj,makruk,chu,dai,tenjiku,12x12+0_fairy,9x9+0_shogi\"\n");
\r
2748 printf("feature myname=\"HaChu " VERSION "\" highlight=1\n");
\r
2749 printf("feature option=\"Full analysis PV -check 1\"\n"); // example of an engine-defined option
\r
2750 printf("feature option=\"Allow repeats -check 0\"\n");
\r
2751 printf("feature option=\"Promote on entry -check 0\"\n");
\r
2752 printf("feature option=\"Resign -check 0\"\n"); //
\r
2753 printf("feature option=\"Contempt -spin 0 -200 200\"\n"); // and another one
\r
2754 printf("feature option=\"Tsume -combo no /// Sente mates /// Gote mates\"\n");
\r
2755 printf("feature done=1\n");
\r
2758 if(!strcmp(command, "option")) { // setting of engine-define option; find out which
\r
2759 if(sscanf(inBuf+7, "Full analysis PV=%d", &noCut) == 1) continue;
\r
2760 if(sscanf(inBuf+7, "Allow repeats=%d", &allowRep) == 1) continue;
\r
2761 if(sscanf(inBuf+7, "Resign=%d", &resign) == 1) continue;
\r
2762 if(sscanf(inBuf+7, "Contempt=%d", &contemptFactor) == 1) continue;
\r
2763 if(sscanf(inBuf+7, "Promote on entry=%d", &entryProm) == 1) continue;
\r
2764 if(sscanf(inBuf+7, "Tsume=%s", command) == 1) {
\r
2765 if(!strcmp(command, "no")) tsume = 0; else
\r
2766 if(!strcmp(command, "Sente")) tsume = 1; else
\r
2767 if(!strcmp(command, "Gote")) tsume = 2;
\r
2772 if(!strcmp(command, "sd")) { sscanf(inBuf, "sd %d", &maxDepth); continue; }
\r
2773 if(!strcmp(command, "st")) { sscanf(inBuf, "st %d", &timePerMove); continue; }
\r
2774 if(!strcmp(command, "memory")) { SetMemorySize(atoi(inBuf+7)); continue; }
\r
2775 if(!strcmp(command, "ping")) { printf("pong%s", inBuf+4); continue; }
\r
2776 // if(!strcmp(command, "")) { sscanf(inBuf, " %d", &); continue; }
\r
2777 if(!strcmp(command, "easy")) { ponder = OFF; continue; }
\r
2778 if(!strcmp(command, "hard")) { ponder = ON; continue; }
\r
2779 if(!strcmp(command, "go")) { engineSide = stm; continue; }
\r
2780 if(!strcmp(command, "post")) { postThinking = ON; continue; }
\r
2781 if(!strcmp(command, "nopost")) { postThinking = OFF;continue; }
\r
2782 if(!strcmp(command, "random")) { randomize = ON; continue; }
\r
2783 if(!strcmp(command, "hint")) { if(ponderMove != INVALID) printf("Hint: %s\n", MoveToText(ponderMove, 0)); continue; }
\r
2784 if(!strcmp(command, "book")) { continue; }
\r
2785 // non-standard commands
\r
2786 if(!strcmp(command, "p")) { pboard(board); continue; }
\r
2787 if(!strcmp(command, "f")) { pbytes(fireBoard); continue; }
\r
2788 if(!strcmp(command, "w")) { MapOneColor(WHITE, last[WHITE], attacks); pmap(attacks, WHITE); continue; }
\r
2789 if(!strcmp(command, "b")) { MapOneColor(BLACK, last[BLACK], attacks); pmap(attacks, BLACK); continue; }
\r
2790 if(!strcmp(command, "l")) { pplist(); continue; }
\r
2791 // ignored commands:
\r
2792 if(!strcmp(command, "xboard")) { continue; }
\r
2793 if(!strcmp(command, "computer")){ comp = 1; continue; }
\r
2794 if(!strcmp(command, "name")) { continue; }
\r
2795 if(!strcmp(command, "ics")) { continue; }
\r
2796 if(!strcmp(command, "accepted")){ continue; }
\r
2797 if(!strcmp(command, "rejected")){ continue; }
\r
2798 if(!strcmp(command, "result")) { engineSide = NONE; continue; }
\r
2799 if(!strcmp(command, "hover")) { continue; }
\r
2800 if(!strcmp(command, "")) { continue; }
\r
2801 if(!strcmp(command, "usermove")){
\r
2802 int move = ParseMove(inBuf+9);
\r
2804 if(move == INVALID) {
\r
2805 if(reason) printf("Illegal move {%s}\n", reason); else printf("%s\n", reason="Illegal move");
\r
2806 if(comp) PrintResult(stm, -INF); // against computer: claim
\r
2808 stm = MakeMove2(stm, move);
\r
2809 ponderMove = INVALID; listEnd = 0;
\r
2810 gameMove[moveNr++] = move; // remember game
\r
2814 ponderMove = INVALID; // the following commands change the position, invalidating ponder move
\r
2816 if(!strcmp(command, "new")) {
\r
2817 engineSide = BLACK; Init(V_CHESS); stm = Setup2(NULL); maxDepth = MAXPLY; randomize = OFF; curVarNr = comp = 0;
\r
2820 if(!strcmp(command, "variant")) {
\r
2821 for(i=0; i<7; i++) {
\r
2822 sscanf(inBuf+8, "%s", command);
\r
2823 if(!strcmp(variants[i].name, command)) {
\r
2824 Init(curVarNr = i); stm = Setup2(NULL); break;
\r
2827 repStack[199] = hashKeyH, checkStack[199] = 0;
\r
2830 if(!strcmp(command, "setboard")){ engineSide = NONE; Init(curVarNr); stm = Setup2(inBuf+9); continue; }
\r
2831 if(!strcmp(command, "undo")) { stm = TakeBack(1); continue; }
\r
2832 if(!strcmp(command, "remove")) { stm = TakeBack(2); continue; }
\r
2833 printf("Error: unknown command\n");
\r
projects / hachu.git / blob