-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchess.h
706 lines (705 loc) · 26 KB
/
chess.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
/*
*******************************************************************************
* *
* configuration information: the following variables need to be set to *
* indicate the machine configuration/capabilities. *
* *
* HAS_64BITS: define this for a machine that has true 64-bit hardware *
* including leading-zero hardware, population count, etc. ie, a Cray-like *
* machine. *
* *
* UNIX: define this if the program is being run on a unix-based system, *
* which causes the executable to use unix-specific runtime utilities. *
* *
* CPUS=N: this sets up data structures to the appropriate size to support *
* up to N simultaneous search engines. note that you can set this to a *
* value larger than the max processors you currently have, because the mt=n *
* command (added to the command line or your crafty.rc/.craftyrc file) will *
* control how many threads are actually spawned. *
* *
*******************************************************************************
*/
/* *INDENT-ON* */
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#if !defined(IPHONE)
# include <malloc.h>
#endif
#include <string.h>
#if !defined(TYPES_INCLUDED)
# include "lock.h"
# if defined (_MSC_VER) && (_MSC_VER >= 1300) && \
(!defined(_M_IX86) || (_MSC_VER >= 1400))
# define RESTRICT __restrict
# else
# define RESTRICT
# endif
# if !defined(CPUS)
# define CPUS 1
# endif
# if defined(NT_i386)
# include <windows.h>
# include <process.h>
# endif
# define TYPES_INCLUDED
# define CDECL
# define STDCALL
/* Provide reasonable defaults for UNIX systems. */
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
/* Architecture-specific definitions */
# if defined(AIX)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(AMIGA)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# undef UNIX /* system is unix-based */
# endif
# if defined(FreeBSD)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(HP)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(LINUX)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(MIPS)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(NetBSD)
# if defined(__alpha__)
# define HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# else
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# endif
# if defined(NEXT)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(NT_i386)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# undef UNIX /* system is unix-based */
# undef STDCALL
# define STDCALL __stdcall
# ifdef VC_INLINE32
# undef CDECL
# define CDECL __cdecl
# endif
# endif
# if defined(OS2)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(SGI)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if defined(SUN)
# undef HAS_64BITS /* machine has 64-bit integers / operators */
# define UNIX /* system is unix-based */
# endif
# if !defined(BOOKDIR)
# define BOOKDIR "."
# endif
# if !defined(LOGDIR)
# define LOGDIR "."
# endif
# if !defined(TBDIR)
# define TBDIR "./TB"
# endif
# if !defined(RCDIR)
# define RCDIR "."
# endif
# if !defined(NOEGTB)
# define EGTB_CACHE_DEFAULT 1024*1024
# endif
# define MAXPLY 65
# define MAX_TC_NODES 3000000
# define MAX_BLOCKS_PER_CPU 64
# define MAX_BLOCKS MAX_BLOCKS_PER_CPU*CPUS
# define BOOK_CLUSTER_SIZE 8000
# define BOOK_POSITION_SIZE 16
# define MERGE_BLOCK 1000
# define SORT_BLOCK 4000000
# define LEARN_INTERVAL 10
# define LEARN_COUNTER_BAD -80
# define LEARN_COUNTER_GOOD +100
# define MATE 32768
# define PAWN_VALUE 100
# define KNIGHT_VALUE 325
# define BISHOP_VALUE 325
# define ROOK_VALUE 500
# define QUEEN_VALUE 1050
# define KING_VALUE 40000
# define MAX_DRAFT 256
# if defined(HAS_64BITS)
typedef unsigned long BITBOARD;
# elif defined(NT_i386)
typedef unsigned __int64 BITBOARD;
# else
typedef unsigned long long BITBOARD;
# endif
# if defined(NT_i386)
# define BMF "%I64u"
# define BMF6 "%6I64u"
# define BMF10 "%10I64u"
# else
# define BMF "%llu"
# define BMF6 "%6llu"
# define BMF10 "%10llu"
# endif
# if defined(UNIX) & (CPUS > 1)
# include <pthread.h>
# endif
# include <time.h>
# if !defined(CLOCKS_PER_SEC)
# define CLOCKS_PER_SEC 1000000
# endif
typedef enum {
A1, B1, C1, D1, E1, F1, G1, H1,
A2, B2, C2, D2, E2, F2, G2, H2,
A3, B3, C3, D3, E3, F3, G3, H3,
A4, B4, C4, D4, E4, F4, G4, H4,
A5, B5, C5, D5, E5, F5, G5, H5,
A6, B6, C6, D6, E6, F6, G6, H6,
A7, B7, C7, D7, E7, F7, G7, H7,
A8, B8, C8, D8, E8, F8, G8, H8,
BAD_SQUARE
} squares;
typedef enum { FILEA, FILEB, FILEC, FILED, FILEE, FILEF, FILEG, FILEH } files;
typedef enum { RANK1, RANK2, RANK3, RANK4, RANK5, RANK6, RANK7, RANK8 } ranks;
typedef enum { empty = 0, occupied = 0, pawn = 1, knight = 2, bishop = 3,
rook = 4, queen = 5, king = 6
} PIECE;
typedef enum { black = 0, white = 1 } COLOR;
typedef enum { mg = 0, eg = 1 } PHASE;
typedef enum { empty_v = 0, pawn_v = 1, knight_v = 3,
bishop_v = 3, rook_v = 5, queen_v = 9, king_v = 99
} PIECE_V;
typedef enum { think = 1, puzzle = 2, book = 3, annotate = 4 } SEARCH_TYPE;
typedef enum { normal_mode, tournament_mode } PLAYING_MODE;
typedef struct {
unsigned char enpassant_target;
signed char castle[2];
unsigned char rule_50_moves;
} SEARCH_POSITION;
typedef struct {
int move1;
int move2;
} KILLER;
typedef struct {
BITBOARD pieces[7];
} BB_PIECES;
typedef struct {
BB_PIECES color[2];
BITBOARD hash_key;
BITBOARD pawn_hash_key;
int material_evaluation;
int kingsq[2];
signed char board[64];
signed char pieces[2][7];
signed char pawns[2];
signed char majors[2];
signed char minors[2];
signed char total_all_pieces;
} POSITION;
typedef struct {
BITBOARD word1;
BITBOARD word2;
} HASH_ENTRY;
typedef struct {
BITBOARD key;
int score_mg, score_eg;
unsigned char defects_k[2];
unsigned char defects_e[2];
unsigned char defects_d[2];
unsigned char defects_q[2];
unsigned char all[2];
unsigned char passed[2];
unsigned char candidates[2];
unsigned char open_files;
unsigned char filler;
} PAWN_HASH_ENTRY;
typedef struct {
BITBOARD entry[4];
} PXOR;
typedef struct {
int path[MAXPLY];
unsigned char pathh;
unsigned char pathl;
unsigned char pathd;
} PATH;
typedef struct {
int phase;
int remaining;
int *last;
} NEXT_MOVE;
typedef struct {
BITBOARD nodes;
int move;
/*
x..xx xxxx xxx1 = failed low once
x..xx xxxx xx1x = failed low twice
x..xx xxxx x1xx = failed low three times
x..xx xxxx 1xxx = failed high once
x..xx xxx1 xxxx = failed high twice
x..xx xx1x xxxx = failed high three times
x..xx x1xx xxxx = don't search in parallel
x..xx 1xxx xxxx = do not reduce this move
x..x1 xxxx xxxx = move has been searched
*/
unsigned int status;
} ROOT_MOVE;
# if defined(NT_i386)
# pragma pack(4)
# endif
typedef struct {
BITBOARD position;
unsigned int status_played;
float learn;
} BOOK_POSITION;
# if defined(NT_i386)
# pragma pack()
# endif
typedef struct {
unsigned char position[8];
unsigned char status;
unsigned char percent_play;
} BB_POSITION;
struct personality_term {
char *description;
int type;
int size;
int *value;
};
struct tree {
POSITION pos;
BITBOARD save_hash_key[MAXPLY + 2];
BITBOARD rep_list[2][128];
BITBOARD all_pawns;
BITBOARD nodes_searched;
BITBOARD save_pawn_hash_key[MAXPLY + 2];
BITBOARD cache_n[64];
PAWN_HASH_ENTRY pawn_score;
SEARCH_POSITION position[MAXPLY + 2];
NEXT_MOVE next_status[MAXPLY];
PATH pv[MAXPLY];
int cache_n_mobility[64];
int rep_index[2];
int curmv[MAXPLY];
int hash_move[MAXPLY];
int *last[MAXPLY];
unsigned int fail_high;
unsigned int fail_high_first;
unsigned int evaluations;
unsigned int egtb_probes;
unsigned int egtb_probes_successful;
unsigned int extensions_done;
unsigned int qchecks_done;
unsigned int reductions_done;
unsigned int moves_pruned;
KILLER killers[MAXPLY];
int move_list[5120];
int sort_value[256];
signed char inchk[MAXPLY];
signed char phase[MAXPLY];
int search_value;
int tropism[2];
int dangerous[2];
int score_mg, score_eg;
int root_move;
# if (CPUS > 1)
lock_t lock;
# endif
long thread_id;
volatile int stop;
char root_move_text[16];
char remaining_moves_text[16];
struct tree *volatile siblings[CPUS], *parent;
volatile int nprocs;
int alpha;
int beta;
int value;
int wtm;
int depth;
int ply;
int cutmove;
int moves_searched;
volatile int used;
};
typedef struct tree TREE;
/*
DO NOT modify these. these are constants, used in multiple modules.
modification may corrupt the search in any number of ways, all bad.
*/
# define WORTHLESS 0
# define LOWER 1
# define UPPER 2
# define EXACT 3
# define AVOID_NULL_MOVE 4
# define EXACTEGTB 5
# define NULL_MOVE 0
# define DO_NULL 1
# define NO_NULL 0
# define NONE 0
# define EVALUATION -1
# define HASH_MOVE 1
# define GENERATE_CAPTURE_MOVES 2
# define CAPTURE_MOVES 3
# define KILLER_MOVE_1 4
# define KILLER_MOVE_2 5
# define GENERATE_ALL_MOVES 6
# define SORT_ALL_MOVES 7
# define REMAINING_MOVES 8
# define ROOT_MOVES 9
# if defined(VC_INLINE32)
# include "vcinline.h"
# else
# if !defined(INLINE64) && !defined(INLINE32)
int CDECL PopCnt(BITBOARD);
int CDECL MSB(BITBOARD);
int CDECL LSB(BITBOARD);
# endif
# endif
void ACHRecordBoardStatePrev(char*);
void ACHRecordBoardStateNext(char*);
void ACHRecordMove(char*);
int ACHInit();
void ACHWrite();
void ACHRead();
void ACHClose();
int ACHInit_In();
int ACHRead_In(char*);
void ACHClose_In();
void AlignedMalloc(void **, int, size_t);
void AlignedRemalloc(void **, int, size_t);
void Analyze(void);
void Annotate(void);
void AnnotateHeaderHTML(char *, FILE *);
void AnnotateFooterHTML(FILE *);
void AnnotatePositionHTML(TREE * RESTRICT, int, FILE *);
char *AnnotateVtoNAG(int, int, int, int);
void AnnotateHeaderTeX(char *, FILE *);
void AnnotateFooterTeX(FILE *);
void AnnotatePositionTeX(TREE *, int, FILE *);
BITBOARD atoiKM(char *);
int Attacks(TREE * RESTRICT, int, int);
BITBOARD AttacksTo(TREE * RESTRICT, int);
void Bench(int);
int Book(TREE * RESTRICT, int, int);
void BookClusterIn(FILE *, int, BOOK_POSITION *);
void BookClusterOut(FILE *, int, BOOK_POSITION *);
int BookIn32(unsigned char *ch);
float BookIn32f(unsigned char *ch);
BITBOARD BookIn64(unsigned char *ch);
int BookMask(char *);
unsigned char *BookOut32(int val);
unsigned char *BookOut32f(float val);
unsigned char *BookOut64(BITBOARD val);
int BookPonderMove(TREE * RESTRICT, int);
void BookUp(TREE * RESTRICT, int, char **);
void BookSort(BB_POSITION *, int, int);
# if defined(NT_i386)
int _cdecl BookUpCompare(const void *, const void *);
# else
int BookUpCompare(const void *, const void *);
# endif
BB_POSITION BookUpNextPosition(int, int);
int CheckInput(void);
void ClearHashTableScores(void);
void CopyFromChild(TREE * RESTRICT, TREE * RESTRICT, int);
TREE *CopyToChild(TREE * RESTRICT, int);
void CraftyExit(int);
void DisplayArray(int *, int);
void DisplayArrayX2(int *, int *, int);
void DisplayBitBoard(BITBOARD);
void Display2BitBoards(BITBOARD, BITBOARD);
void DisplayChessBoard(FILE *, POSITION);
char *DisplayEvaluation(int, int);
char *DisplayEvaluationKibitz(int, int);
void DisplayFT(int, int, int);
char *DisplayHHMM(unsigned int);
char *DisplayHHMMSS(unsigned int);
char *DisplayKM(unsigned int);
void DisplayPV(TREE * RESTRICT, int, int, int, int, PATH *);
char *DisplayTime(unsigned int);
char *DisplayTimeKibitz(unsigned int);
void DisplayTreeState(TREE * RESTRICT, int, int, int);
void DisplayChessMove(char *, int);
int Drawn(TREE * RESTRICT, int);
void DisplayType3(int *, int *);
void DisplayType4(int *, int *);
void DisplayType5(int *, int *, int);
void DisplayType6(int *, int *);
void DisplayType7(int *, int *);
void DisplayType8(int *, int);
void DisplayType9(int *, int *);
void Edit(void);
# if !defined(NOEGTB)
int EGTBProbe(TREE * RESTRICT, int, int, int *);
void EGTBPV(TREE * RESTRICT, int);
# endif
int Evaluate(TREE * RESTRICT, int, int, int, int);
void EvaluateBishops(TREE * RESTRICT, int);
void EvaluateDevelopment(TREE * RESTRICT, int, int);
int EvaluateDraws(TREE * RESTRICT, int, int, int);
void EvaluateKings(TREE * RESTRICT, int, int);
int EvaluateKingsFile(TREE * RESTRICT, int, int);
void EvaluateKnights(TREE * RESTRICT, int);
void EvaluateMate(TREE * RESTRICT, int);
void EvaluateMaterial(TREE * RESTRICT, int);
void EvaluatePassedPawns(TREE * RESTRICT, int);
void EvaluatePassedPawnRaces(TREE * RESTRICT, int);
void EvaluatePawns(TREE * RESTRICT, int);
void EvaluateQueens(TREE * RESTRICT, int);
void EvaluateRooks(TREE * RESTRICT, int);
int EvaluateWinningChances(TREE * RESTRICT, int, int);
void EVTest(char *);
int FindBlockID(TREE * RESTRICT);
char *FormatPV(TREE * RESTRICT, int, PATH);
int FTbSetCacheSize(void *, unsigned long);
int GameOver(int);
int *GenerateCaptures(TREE * RESTRICT, int, int, int *);
int *GenerateCheckEvasions(TREE * RESTRICT, int, int, int *);
int *GenerateChecks(TREE * RESTRICT, int, int, int *);
int *GenerateNoncaptures(TREE * RESTRICT, int, int, int *);
int HashProbe(TREE * RESTRICT, int, int, int, int *, int);
void HashStore(TREE * RESTRICT, int, int, int, int, int, int);
void HashStorePV(TREE * RESTRICT, int, int);
int EvaluateHasOpposition(int, int, int);
int IInitializeTb(char *);
void Initialize(void);
void InitializePipes(void);
void InitializeAttackBoards(void);
void InitializeChessBoard(TREE *);
int InitializeGetLogID();
void InitializeHashTables(void);
void InitializeKillers(void);
void InitializeKingSafety(void);
void InitializeMagic(void);
BITBOARD InitializeMagicBishop(int, BITBOARD);
BITBOARD InitializeMagicRook(int, BITBOARD);
BITBOARD InitializeMagicOccupied(int *, int, BITBOARD);
void InitializeMasks(void);
void InitializePawnMasks(void);
void InitializeSMP(void);
int InputMove(TREE * RESTRICT, char *, int, int, int, int);
int InputMoveICS(TREE * RESTRICT, char *, int, int, int, int);
BITBOARD InterposeSquares(int, int, int);
void Interrupt(int);
int InvalidPosition(TREE * RESTRICT);
int Iterate(int, int, int);
void Kibitz(int, int, int, int, int, BITBOARD, int, char *);
void Killer(TREE * RESTRICT, int, int);
int KingPawnSquare(int, int, int, int);
void LearnBook(void);
int LearnFunction(int, int, int, int);
void LearnValue(int, int);
void MakeMove(TREE * RESTRICT, int, int, int);
void MakeMoveRoot(TREE * RESTRICT, int, int);
void NewGame(int);
int NextEvasion(TREE * RESTRICT, int, int);
int NextMove(TREE * RESTRICT, int, int);
int NextRootMove(TREE * RESTRICT, TREE * RESTRICT, int);
int NextRootMoveParallel(void);
int Option(TREE * RESTRICT);
int OptionMatch(char *, char *);
void OptionPerft(TREE * RESTRICT, int, int, int);
void Output(TREE * RESTRICT, int, int);
char *OutputMoveExtended(TREE * RESTRICT, int, int, int);
char *OutputMove(TREE * RESTRICT, int, int, int);
char *OutputMoveICS(int);
int OutputGood(TREE * RESTRICT, char *, int, int);
int ParseTime(char *);
void Pass(void);
int PinnedOnKing(TREE * RESTRICT, int, int);
int Ponder(int);
void PreEvaluate(TREE * RESTRICT);
void Print(int, char *, ...);
char *PrintKM(size_t, int);
int Quiesce(TREE * RESTRICT, int, int, int, int);
int QuiesceChecks(TREE * RESTRICT, int, int, int, int);
int QuiesceEvasions(TREE * RESTRICT, int, int, int, int);
unsigned int Random32(void);
BITBOARD Random64(void);
int Read(int, char *);
int ReadChessMove(TREE * RESTRICT, FILE *, int, int);
void ReadClear(void);
unsigned int ReadClock(void);
int ReadPGN(FILE *, int);
int ReadNextMove(TREE * RESTRICT, char *, int, int);
int ReadParse(char *, char *args[], char *);
int ReadInput(void);
int RepetitionCheck(TREE * RESTRICT, int, int);
int RepetitionCheckBook(TREE * RESTRICT, int, int);
int RepetitionDraw(TREE * RESTRICT, int, int);
void ResignOrDraw(TREE * RESTRICT, int);
void RestoreGame(void);
void RootMoveList(int);
int Search(TREE * RESTRICT, int, int, int, int, int, int);
int SearchRoot(TREE * RESTRICT, int, int, int, int);
int SearchParallel(TREE * RESTRICT, int, int, int, int, int, int);
void Trace(TREE * RESTRICT, int, int, int, int, int, char *, int);
void SetBoard(TREE *, int, char **, int);
void SetChessBitBoards(TREE *);
int SetRootAlpha(unsigned char, int);
int SetRootBeta(unsigned char, int);
void SharedFree(void *address);
int StrCnt(char *, char);
int Swap(TREE * RESTRICT, int, int);
int SwapO(TREE * RESTRICT, int, int);
void Test(char *);
void TestEPD(char *);
int Thread(TREE * RESTRICT);
void WaitForAllThreadsInitialized(void);
void *STDCALL ThreadInit(void *);
# if defined(_WIN32) || defined(_WIN64)
void ThreadMalloc(int);
# endif
void ThreadStop(TREE * RESTRICT);
int ThreadWait(long, TREE * RESTRICT);
void TimeAdjust(int, int);
int TimeCheck(TREE * RESTRICT, int);
void TimeSet(TREE * RESTRICT, int);
void UnmakeMove(TREE * RESTRICT, int, int, int);
int ValidMove(TREE * RESTRICT, int, int, int);
int VerifyMove(TREE * RESTRICT, int, int, int);
void ValidatePosition(TREE * RESTRICT, int, int, char *);
# if defined(_WIN32) || defined(_WIN64)
extern void *WinMallocInterleaved(size_t, int);
extern void WinFreeInterleaved(void *, size_t);
# define MallocInterleaved(cBytes, cThreads)\
WinMallocInterleaved(cBytes, cThreads)
# define FreeInterleaved(pMemory, cBytes)\
WinFreeInterleaved(pMemory, cBytes)
# else
# if defined(NUMA)
# define MallocInterleaved(cBytes, cThreads) numa_alloc_interleaved(cBytes)
# define FreeInterleaved(pMemory, cBytes) numa_free(pMemory, 1)
# else
# define MallocInterleaved(cBytes, cThreads) malloc(cBytes)
# define FreeInterleaved(pMemory, cBytes) free(pMemory)
# endif
# endif
# define Abs(a) (((a) > 0) ? (a) : -(a))
# define Max(a,b) (((a) > (b)) ? (a) : (b))
# define Min(a,b) (((a) < (b)) ? (a) : (b))
# define FileDistance(a,b) abs(File(a) - File(b))
# define RankDistance(a,b) abs(Rank(a) - Rank(b))
# define Distance(a,b) Max(FileDistance(a,b), RankDistance(a,b))
# define DrawScore(side) (draw_score[side])
# define PopCnt8Bit(a) (pop_cnt_8bit[a])
# define MSB8Bit(a) (msb_8bit[a])
# define LSB8Bit(a) (lsb_8bit[a])
/*
side = side to move
mptr = pointer into move list
m = bit vector of to squares to unpack
t = pre-computed from + moving piece
*/
# define Unpack(side, mptr, m, t) \
for ( ; m ; Clear(to, m)) { \
to = Advanced(side, m); \
*mptr++ = t | (to << 6) | (Abs(PcOnSq(to)) << 15); \
}
# define Check(side) Attacks(tree, KingSQ(side), Flip(side))
# define Attack(from,to) (!(obstructed[from][to] & OccupiedSquares))
# define AttacksBishop(square, occ) *(magic_bishop_indices[square]+((((occ)&magic_bishop_mask[square])*magic_bishop[square])>>magic_bishop_shift[square]))
# define MobilityBishop(square, occ) *(magic_bishop_mobility_indices[square]+((((occ)&magic_bishop_mask[square])*magic_bishop[square])>>magic_bishop_shift[square]))
# define AttacksKnight(square) knight_attacks[square]
# define AttacksRook(square, occ) *(magic_rook_indices[square]+((((occ)&magic_rook_mask[square])*magic_rook[square])>>magic_rook_shift[square]))
# define MobilityRook(square, occ) *(magic_rook_mobility_indices[square]+((((occ)&magic_rook_mask[square])*magic_rook[square])>>magic_rook_shift[square]))
# define AttacksQueen(square, occ) (AttacksBishop(square, occ)|AttacksRook(square, occ))
# define AttacksQueen(square, occ) (AttacksBishop(square, occ)|AttacksRook(square, occ))
# define Rank(x) ((x)>>3)
# define File(x) ((x)&7)
# define Flip(x) ((x)^1)
# define PawnAttacks(side, x) (pawn_attacks[Flip(side)][(x)] & Pawns(side))
# define Advanced(side, squares) ((side) ? MSB(squares) : LSB(squares))
# define MinMax(side, v1, v2) ((side) ? Min((v1), (v2)) : Max((v1), (v2)))
# define InFront(side, k, p) ((side) ? k > p : k < p)
# define Behind(side, k, p) ((side) ? k < p : k > p)
# define AttacksRank(a) (AttacksRook(a, OccupiedSquares) & rank_mask[Rank(a)])
# define AttacksFile(a) (AttacksRook(a, OccupiedSquares) & file_mask[File(a)])
# define AttacksDiaga1(a) (AttacksBishop(a, OccupiedSquares) & (plus9dir[a] | minus9dir[a]))
# define AttacksDiagh1(a) (AttacksBishop(a, OccupiedSquares) & (plus7dir[a] | minus7dir[a]))
/*
the following macros are used to extract the pieces of a move that are
kept compressed into the rightmost 21 bits of a simple integer.
*/
# define From(a) ((a) & 63)
# define To(a) (((a)>>6) & 63)
# define Piece(a) (((a)>>12) & 7)
# define Captured(a) (((a)>>15) & 7)
# define Promote(a) (((a)>>18) & 7)
# define CaptureOrPromote(a) (((a)>>15) & 63)
# define SetMask(a) (set_mask[a])
# define ClearMask(a) (clear_mask[a])
# define Pawns(c) (tree->pos.color[c].pieces[pawn])
# define Knights(c) (tree->pos.color[c].pieces[knight])
# define Bishops(c) (tree->pos.color[c].pieces[bishop])
# define Rooks(c) (tree->pos.color[c].pieces[rook])
# define Queens(c) (tree->pos.color[c].pieces[queen])
# define Kings(c) (tree->pos.color[c].pieces[king])
# define KingSQ(c) (tree->pos.kingsq[c])
# define Occupied(c) (tree->pos.color[c].pieces[occupied])
# define Pieces(c, p) (tree->pos.color[c].pieces[p])
# define TotalPieces(c, p) (tree->pos.pieces[c][p])
# define PieceValues(c, p) (piece_values[p][c])
# define TotalAllPieces (tree->pos.total_all_pieces)
# define Material (tree->pos.material_evaluation)
# define MaterialSTM(side) ((side) ? Material : -Material)
# define Castle(ply, c) (tree->position[ply].castle[c])
# define Rule50Moves(ply) (tree->position[ply].rule_50_moves)
# define Repetition(side) (tree->rep_index[side])
# define HashKey (tree->pos.hash_key)
# define PawnHashKey (tree->pos.pawn_hash_key)
# define EnPassant(ply) (tree->position[ply].enpassant_target)
# define EnPassantTarget(ply) (EnPassant(ply) ? SetMask(EnPassant(ply)) : 0)
# define PcOnSq(sq) (tree->pos.board[sq])
# define OccupiedSquares (Occupied(white) | Occupied(black))
# define Color(square) (square_color[square] ? dark_squares : ~dark_squares)
# define SideToMove(c) ((c) ? "White" : "Black")
/*
the following macros are used to Set and Clear a specific bit in the
second argument. this is done to make the code more readable, rather
than to make it faster.
*/
# define ClearSet(a,b) b=((a) ^ (b))
# define Clear(a,b) b=ClearMask(a) & (b)
# define Set(a,b) b=SetMask(a) | (b)
/*
the following macros are used to update the hash signatures.
*/
# define Hash(stm,piece,square) (HashKey^=randoms[stm][piece][square])
# define HashP(stm,square) (PawnHashKey^=randoms[stm][pawn][square])
# define HashCastle(stm,direction) (HashKey^=castle_random[stm][direction])
# define HashEP(stm) (HashKey^=enpassant_random[stm])
# define SavePV(tree,ply,ph) do { \
tree->pv[ply-1].path[ply-1]=tree->curmv[ply-1]; \
tree->pv[ply-1].pathl=ply-1; \
tree->pv[ply-1].pathh=ph; \
tree->pv[ply-1].pathd=iteration_depth;} while(0)
# if defined(INLINE64)
# include "inline64.h"
# endif
# if defined(INLINE32)
# include "inline32.h"
# endif
# if defined(UNIX)
# define SPEAK "./speak "
# else
# define SPEAK ".\\Speak.exe "
# endif
#endif /* if defined(TYPES_INCLUDED) */
/* *INDENT-OFF* */