-
Notifications
You must be signed in to change notification settings - Fork 1
/
KestoG_1_4.cpp
4255 lines (3820 loc) · 153 KB
/
KestoG_1_4.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//************************************************
//* *
//* Kallisto support *
//* *
//*************************************************
// ôóíêöèÿ îáðàòíîãî âûçîâà äëÿ îòîáðàæåíèÿ èíôîðìàöèè î õîäå âû÷èñëåíèé
// pv - ëó÷øèé âàðèàíò
// cm - õîä àíàëèçèðóåìûé â äàííûé ìîìåíò
typedef void (__stdcall *PF_SearchInfo)(int score, int depth, int speed, char *pv, char *cm);
PF_SearchInfo pfSearchInfo = 0;
// This function needed to show search info
#include <fstream>
using namespace std;
//*************************************************
//* *
//* KestoG sources *
//* *
//*************************************************
/* includes */
#define WIN32_LEAN_AND_MEAN // exclude rarely used stuff from headers
#include <stdio.h>
#include <stdlib.h> // for malloc()
#include <string.h> // for memset()
#include <windows.h>
#include <time.h>
#include <math.h>
#include <assert.h>
#include "EdAccess.h"
#include "KALLISTO.H" // f-ion prototypes
/* board values */
#define OCCUPIED 16
#define WHITE 1
#define BLACK 2
#define MAN 4
#define KING 8
#define FREE 0
#define BLK_MAN (BLACK|MAN)
#define WHT_MAN (WHITE|MAN)
#define BLK_KNG (BLACK|KING)
#define WHT_KNG (WHITE|KING)
#define SHIFT1 (BLK_MAN << 8)
#define SHIFT2 (WHT_MAN << 8)
#define SHIFT3 (BLK_KNG << 8)
#define SHIFT4 (WHT_KNG << 8)
#define CHANGECOLOR 3
#define MAXDEPTH 60
#define MAXMOVES 60 // ??
#define MAXHIST 16384
#define UPPER 1
#define LOWER 2
#define EXACT 3
#define MATE 10000 // de facto accepted value
#define HASHMATE 9744
#define ED_WIN 30000
#define REHASH 4
#define ETCDEPTH 4 // if depth >= ETCDEPTH do ETC
#define WINDOW 40
//#define KALLISTOAPI WINAPI
//#undef KALLISTO // uncomment if compile to CheckerBoard
#define KALLISTO // uncomment if compile to KallistoGUI
/*----------> compile options */
// not used options
//#define PERFT
#undef PERFT
#undef MUTE
#undef VERBOSE
#undef STATISTICS
/* getmove return values */
#define DRAW 0
#define WIN 1
#define LOSS 2
#define UNKNOWN 3
#define TICKS CLK_TCK
#define SWAPINT(a,b) {int t;t=a;a=b;b=t;}
/* definitions of new types */
typedef unsigned __int64 U64;
typedef unsigned __int32 U32;
typedef struct {
U32 m_lock;
int m_value:16;
int m_depth:8;
unsigned int m_valuetype:2;
signed int m_best_from:8;
signed int m_best_to:8;
int m_age;
} TEntry;
#define NODE_OPP(type) (-(type))
#define ISWINSCORE(score) ((score) >= HASHMATE)
#define ISLOSSSCORE(score) ((score) <= -HASHMATE)
struct coor /* coordinate structure for board coordinates */
{
unsigned int x;
unsigned int y;
};
struct CBmove // all the information there is about a move
{
int jumps; // how many jumps are there in this move?
unsigned int newpiece; // what type of piece appears on to
unsigned int oldpiece; // what disappears on from
struct coor from, to; // coordinates of the piece in 8x8 notation!
struct coor path[12]; // intermediate path coordinates
struct coor del[12]; // squares whose pieces are deleted
unsigned int delpiece[12]; // what is on these squares
} GCBmove;
struct move2
{
unsigned short m[12];
char path[11]; // was short path[12];
char l;// move's length
};
/* function prototypes */
static int PVSearch(int b[46],int depth,int fracDepth,int trunc,int alpha,int beta,int color,int node_type,int iid_search,int xcapture);
static int rootsearch(int b[46], int alpha, int beta, int depth,int color,int search_type);
static int compute( int b[46],int color, int time, char output[256]);
static int eval(int b[46], int color, int alpha, int beta, bool in_pv);
static void domove(int b[46],struct move2 *move,int stm);
static void domove2(int b[46],struct move2 *move,int stm);
static void undomove(int b[46],struct move2 *move,int stm);
static void update_hash(struct move2 *move);
static int Gen_Captures(int b[46],struct move2 movelist[MAXMOVES],int color );
static int Gen_Moves(int b[46],struct move2 movelist[MAXMOVES],int color );
static int Gen_Proms(int b[46],struct move2 movelist[10],int color );
static void black_king_capture(int b[46], int *n, struct move2 movelist[MAXMOVES], int j,int in_dir);
static void black_man_capture(int b[46], int *n, struct move2 movelist[MAXMOVES], int j,int in_dir);
static void white_king_capture(int b[46], int *n, struct move2 movelist[MAXMOVES], int j,int in_dir);
static void white_man_capture(int b[46], int *n, struct move2 movelist[MAXMOVES], int j,int in_dir);
static int Test_Capture(int b[46], int color);
static int Test_From_pb( int b[46],int mloc,int dir);
static int Test_From_cb( int b[46], int mloc,int dir);
static int Test_From_pw( int b[46],int mloc,int dir);
static int Test_From_cw( int b[46], int mloc,int dir);
static void setbestmove(struct move2 move);
static void MoveToStr(move2 m, char *s);
static struct coor numbertocoor(int n);
static void movetonotation(struct move2 move,char str[80]);
static U64 rand64(void);
static U64 Position_to_Hashnumber( int b[46] , int color );
static void Create_HashFunction(void);
static void TTableInit( unsigned int size);
static void retrievepv( int b[46], char *pv, int color);
static int hashretrieve(int depth,int *value,int *alpha,int *beta,int *best_from,int *best_to,int *try_mcp,bool in_pv);
static void hashstore(int value,int depth,int alpha,int beta,int best_from,int best_to);
static U64 getUniqueZobrist(void);
static BOOL isZobristUnique(U64 key);
static __inline int weight();
static void ClearHistory(void);
static void QuickSort( int SortVals[MAXMOVES],struct move2 movelist[MAXMOVES], int inf, int sup);
static void Perft(int b[46],int color,int depth);
static void good_move( int from,int to,int ply);
static __inline void history_bad( int from,int to );
static __inline void history_good( int from,int to );
static __inline bool ok_to_reduce( int from,int to );
static __inline bool ok_to_prune( int from,int to,int depth );
static bool move_is_dangerous( int b[46],struct move2 *move );
static int __inline is_promotion(struct move2 *move);
static int matval(int b[46],int color);
static __inline int get_phase(void);
static int pick_next_move( int *marker,int SortVals[MAXMOVES],int n );
static void Sort( int start,int num, int SortVals[],struct move2 movelist[] );
static void init( int b[46] );
int EdProbe(int c[46],int color);
/*----------> globals */
CRITICAL_SECTION AnalyseSection;
int *play;
U64 ZobristNumbers[47][17];
U64 HashSTM; // random number - side to move
U64 HASH_KEY; // global variable HASH_KEY
U32 MASK;
unsigned int size = 8; // default size 8 MB
int realdepth;
int nodes; // better double nodes;?
struct move2 bestrootmove;
unsigned int History[46][46]; // array used by history heuristics
unsigned int HistHit[46][46]; // good moves which not failed-low
unsigned int HistTot[46][46]; // all played moves
// killer slots
int killersf1[MAXDEPTH+1];
int killerst1[MAXDEPTH+1];
int killersf2[MAXDEPTH+1];
int killerst2[MAXDEPTH+1];
int killersf3[MAXDEPTH+1];
int killerst3[MAXDEPTH+1];
int killer_scores1[MAXDEPTH+1];
int killer_scores2[MAXDEPTH+1];
int killer_scores3[MAXDEPTH+1];
double PerftNodes;
static const int directions[4] = { 0x4,0x5,-0x4,-0x5 };
// static const int g_dirs[4] = { 0x8,0x4,0x2,0x1 };
static const int NodeAll = -1;
static const int NodePV = 0;
static const int NodeCut = +1;
//static int HistoryValue = 10650; // 10650 == 65% 9830 == 60% 9010==55% 11469==70%
int root_depth;
enum game_phase {OPENING = 0,MIDGAME = 1,ENDGAME = 2};
static const int MVALUE[11] = {0,0,0,0,0,100,100,0,0,300,300};
static int g_pieces[11]; // global array
double start,t,maxtime; // time variables
const int SearchNormal = 0;
const int SearchShort = 1;
// margins for reduction based on remaining depth
int red_margin[] =
{
0, 0, 0, 400, 500, 600, 700, 800, 900, 1000, 1100, 1200,
1300, 1400, 1500, 1600, 1700, 1800, 1900, 2000, 2100, 2200,
2300, 2400, 2500, 2600, 2700, 2800, 2900, 3000, 3100, 4000
};
//int red[] = { 0,110,200,300};
static unsigned int indices[41]; // indexes into p_list for a given square
static unsigned int p_list[3][16]; // p_list contains the location of all the pieces of either color
static unsigned int captured_number[MAXDEPTH][12];
int num_wpieces;
int num_bpieces;
int searches_performed_in_game;
TEntry *ttable=NULL;
EdAccess *ED = NULL;
unsigned int EdPieces = 0;
bool Reversible[MAXDEPTH];
int EdRoot[3];
bool EdNocaptures = false;
#pragma warn -8057 // disable warning #8057 when compiling
#pragma warn -8004 // disable warning #8004 when compiling
/* dll stuff */
BOOL WINAPI
DllEntryPoint (HANDLE hDLL, DWORD dwReason, LPVOID lpReserved)
{
/* in a dll you used to have LibMain instead of WinMain in
windows programs, or main in normal C programs win32
replaces LibMain with DllEntryPoint. */
switch (dwReason)
{
case DLL_PROCESS_ATTACH:
/* dll loaded. put initializations here! */
break;
case DLL_PROCESS_DETACH:
/* program is unloading dll. put clean up here! */
break;
case DLL_THREAD_ATTACH:
break;
case DLL_THREAD_DETACH:
break;
default:
break;
}
return TRUE;
}
/* CheckerBoard API: enginecommand(), islegal(), getmove() */
int WINAPI
enginecommand (char str[256], char reply[1024])
{
/* answer to commands sent by CheckerBoard. This does not
* answer to some of the commands, eg it has no engine
* options. */
char command[256], param1[256], param2[256];
char *stopstring;
sscanf (str, "%s %s %s", command, param1, param2);
// check for command keywords
if (strcmp (command, "name") == 0)
{
sprintf (reply, "KestoG engine v1.4");
return 1;
}
if (strcmp (command, "about") == 0)
{
sprintf (reply,"KestoG engine v1.4\n by Kestutis Gasaitis\nEngine which plays Russian checkers\n2007\nE-mail to:kestasl8t@delfi.lt with any comments.");
return 1;
}
if (strcmp (command, "help") == 0)
{
sprintf (reply, "missing.htm");
return 0;
}
if (strcmp (command, "set") == 0)
{
if (strcmp (param1, "hashsize") == 0)
{
size = strtol( param2, &stopstring, 10 );
if ( size < 1) return 0;
if ( size > 128) size = 128;
return 1;
}
if (strcmp (param1, "book") == 0)
{
return 0;
}
}
if (strcmp (command, "get") == 0)
{
if (strcmp (param1, "hashsize") == 0)
{
return 0;
}
if (strcmp (param1, "book") == 0)
{
return 0;
}
if (strcmp (param1, "protocolversion") == 0)
{
sprintf (reply, "2");
return 1;
}
if (strcmp (param1, "gametype") == 0)
{
sprintf (reply, "25"); // 25 stands for Russian checkers
return 1;
}
}
strcpy (reply, "?");
return 0;
}
int WINAPI
islegal (int b[8][8], int color, int from, int to,struct CBmove *move)
{
/* islegal tells CheckerBoard if a move the user wants to
* make is legal or not. to check this, we generate a
* movelist and compare the moves in the movelist to the
* move the user wants to make with from & to */
int n,i,found=0,Lfrom,Lto;
struct move2 movelist[MAXMOVES];
int board[46];
int capture;
char Lstr[80];
/* initialize board */
for(i=0;i<46;i++)
board[i]=OCCUPIED;
for(i=5;i<=40;i++)
board[i]=FREE;
board[5]=b[0][0];board[6]=b[2][0];board[7]=b[4][0];board[8]=b[6][0];
board[10]=b[1][1];board[11]=b[3][1];board[12]=b[5][1];board[13]=b[7][1];
board[14]=b[0][2];board[15]=b[2][2];board[16]=b[4][2];board[17]=b[6][2];
board[19]=b[1][3];board[20]=b[3][3];board[21]=b[5][3];board[22]=b[7][3];
board[23]=b[0][4];board[24]=b[2][4];board[25]=b[4][4];board[26]=b[6][4];
board[28]=b[1][5];board[29]=b[3][5];board[30]=b[5][5];board[31]=b[7][5];
board[32]=b[0][6];board[33]=b[2][6];board[34]=b[4][6];board[35]=b[6][6];
board[37]=b[1][7];board[38]=b[3][7];board[39]=b[5][7];board[40]=b[7][7];
for(i=5;i<=40;i++)
if(board[i] == 0) board[i]=FREE;
for(i=9;i<=36;i+=9)
board[i]=OCCUPIED;
init(board);
/* board initialized */
n = Gen_Captures( board,movelist,color );
capture=n;
if (!n)
n = Gen_Moves( board,movelist,color );
if (!n) return 0;
/* now we have a movelist - check if from and to are the same */
for(i=0;i<n;i++)
{
movetonotation(movelist[i],Lstr);
if ( capture )
sscanf(Lstr,"%i%*c%i",&Lfrom,&Lto);
else
sscanf(Lstr,"%i%*c%i",&Lfrom,&Lto);
if(from==Lfrom && to==Lto)
{
found=1;
break;
}
}
if(found){
/* sets GCBmove to movelist[i] */
setbestmove(movelist[i]);
*move=GCBmove;
}
return found;
}
int WINAPI
getmove (int board[8][8],int color,double maxtime,char str[1024],int *playnow,int info,int unused,struct CBmove *move)
{
/* getmove is what checkerboard calls. you get the parameters:
- b[8][8]
is the current position. the values in the array are
determined by the #defined values of BLACK, WHITE, KING,
MAN. a black king for instance is represented by BLACK|KING.
- color
is the side to make a move. BLACK or WHITE.
- maxtime
is the time your program should use to make a move. this
is what you specify as level in checkerboard. so if you
exceed this time it's
not too bad - just
don't exceed it
too much...
- str
is a pointer to the output string of the checkerboard status bar.
you can use sprintf(str,"information"); to print any information you
want into the status bar.
- *playnow
is a pointer to the playnow variable of checkerboard. if
the user would like your engine to play immediately, this
value is nonzero, else zero. you should respond to a
nonzero value of *playnow by interrupting your search
IMMEDIATELY.
- CBmove
tells checkerboard what your move is, see above.
*/
int i;
int value;
int b[46];
int time = (int)(maxtime * 1000.0);
double t, elapsed;
// Create_HashFunction();
/* initialize board */
for(i=0;i<46;i++)
b[i]=OCCUPIED;
for(i=5;i<=40;i++)
b[i]=FREE;
/* (white)
37 38 39 40
32 33 34 35
28 29 30 31
23 24 25 26
19 20 21 22
14 15 16 17
10 11 12 13
5 6 7 8
(black) */
b[5]=board[0][0];b[6]=board[2][0];b[7]=board[4][0];b[8]=board[6][0];
b[10]=board[1][1];b[11]=board[3][1];b[12]=board[5][1];b[13]=board[7][1];
b[14]=board[0][2];b[15]=board[2][2];b[16]=board[4][2];b[17]=board[6][2];
b[19]=board[1][3];b[20]=board[3][3];b[21]=board[5][3];b[22]=board[7][3];
b[23]=board[0][4];b[24]=board[2][4];b[25]=board[4][4];b[26]=board[6][4];
b[28]=board[1][5];b[29]=board[3][5];b[30]=board[5][5];b[31]=board[7][5];
b[32]=board[0][6];b[33]=board[2][6];b[34]=board[4][6];b[35]=board[6][6];
b[37]=board[1][7];b[38]=board[3][7];b[39]=board[5][7];b[40]=board[7][7];
for(i=5;i<=40;i++)
if ( b[i] == 0 ) b[i]=FREE;
for(i=9;i<=36;i+=9)
b[i]=OCCUPIED;
play=playnow;
#ifdef PERFT
t=clock();
init(b);
PerftNodes = 0;
realdepth = 0;
Perft(b,color,10);
elapsed = (clock()-t)/(double)CLK_TCK;
sprintf(str,"[done][time %.2fs][PerftNodes %.0f]" ,elapsed,PerftNodes);
#else
init(b);
if ( info&1 ){
TTableInit(size);
searches_performed_in_game = 0;
Create_HashFunction();
}
value = compute(b, color,time, str);
#endif
for(i=5;i<=40;i++)
if( b[i] == FREE) b[i]=0;
/* return the board */
board[0][0]=b[5];board[2][0]=b[6];board[4][0]=b[7];board[6][0]=b[8];
board[1][1]=b[10];board[3][1]=b[11];board[5][1]=b[12];board[7][1]=b[13];
board[0][2]=b[14];board[2][2]=b[15];board[4][2]=b[16];board[6][2]=b[17];
board[1][3]=b[19];board[3][3]=b[20];board[5][3]=b[21];board[7][3]=b[22];
board[0][4]=b[23];board[2][4]=b[24];board[4][4]=b[25];board[6][4]=b[26];
board[1][5]=b[28];board[3][5]=b[29];board[5][5]=b[30];board[7][5]=b[31];
board[0][6]=b[32];board[2][6]=b[33];board[4][6]=b[34];board[6][6]=b[35];
board[1][7]=b[37];board[3][7]=b[38];board[5][7]=b[39];board[7][7]=b[40];
/* set the move */
*move=GCBmove;
if(value>=HASHMATE) return WIN;
if(value<=-HASHMATE) return LOSS;
return UNKNOWN;
}
static void black_king_capture( int b[46], int *n, struct move2 movelist[MAXMOVES],int j,int in_dir){
//
int m; // auxiliary variable
int temp; // temporary variable
int capsq; // captured square address
int found_cap = 0;
int found_pd;
struct move2 move,orgmove;
int i; // loop counter
int dir;
int next_dir;
orgmove = movelist[*n];
for ( i =0; i < 4 ; i++ ){ // scan all 4 directions
if ( !(in_dir >> (( 3 - i ) & 1)) ) continue;
dir = directions[i]; // dir = 4,5,-4,-5.
temp = j; // from square
do temp += dir; while ( !b[temp] );
if ( ( b[temp] & WHITE ) != 0 ){ /* ----===========---- */
temp = temp + dir;
if ( b[temp] ) continue;
capsq = temp - dir; // fix captured square address in capsq
found_pd = 0;
do{
if ( Test_From_pb(b,temp,dir) ){
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = temp;
m = SHIFT3|temp;
move.m[1] = m;
m = (b[capsq]<<8)|capsq;
move.m[move.l - 1] = m;
found_pd++;
found_cap = 1;
movelist[*n] = move;
b[capsq]++;
// further jumps
switch (i){
case 0:next_dir = ( found_pd == 1 ) ? 13:5;break; // in binary form 1101:0101
case 1:next_dir = ( found_pd == 1 ) ? 14:10;break; // in binary form 1110:1010
case 2:next_dir = ( found_pd == 1 ) ? 7:5;break; // in binary form 0111:0101
case 3:next_dir = ( found_pd == 1 ) ? 11:10;break; // in binary form 1011:1010
}
black_king_capture(b, n, movelist, temp,next_dir);
b[capsq]--;
} // if
temp = temp + dir;
} while ( !b[temp] );
if ( !found_pd ){
if ( (b[temp] & WHITE) != 0 && !b[temp+dir] ){
temp = capsq + dir;
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = temp;
m = SHIFT3|temp;
move.m[1] = m;
m = (b[capsq]<<8)|capsq;
move.m[move.l - 1] = m;
found_cap = 1;
movelist[*n] = move;
b[capsq]++;
// further 1 jump
// next_dir = g_dirs[i]; // 8,4,2,1
switch (i){
case 0:next_dir = 8;break;
case 1:next_dir = 4;break;
case 2:next_dir = 2;break;
case 3:next_dir = 1;break;
}
black_king_capture(b, n, movelist, temp,next_dir);
b[capsq]--;
} // if
else{
temp = capsq + dir;
do{
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = temp;
m = SHIFT3|temp;
move.m[1] = m;
m = (b[capsq]<<8)|capsq;
move.m[move.l - 1] = m;
found_cap = 1;
movelist[*n] = move;
(*n)++;
temp = temp + dir;
}while ( !b[temp] );
}
}
} // /* ----===========---- */
} // for
if ( !found_cap ) (*n)++;
}
static void black_man_capture( int b[46], int *n,struct move2 movelist[MAXMOVES] ,int j,int in_dir){
//
int m; // auxiliary variable
int found_cap = 0;
struct move2 move,orgmove;
int i;
int dir;
orgmove = movelist[*n];
for ( i = 0; i < 4; i++ ){ // scan all 4 directions
dir = directions[i]; // dir = 4,5,-4,-5.
if ( dir == in_dir ) continue;
int sq1 = j + dir;
if ( ( b[sq1] & WHITE ) != 0 ){
int sq2 = j + (dir<<1);
if ( !b[sq2] ){
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = sq2;
m = (b[sq1]<<8)|sq1;
move.m[move.l - 1] = m;
if ( sq2 >= 37 ){ // promotion
m = SHIFT3|sq2;
move.m[1] = m;
movelist[*n] = move;
found_cap = 1;
if ( sq2 == 37 || sq2 == 40 )
(*n)++;
else{
dir = (dir == 4)?1:2;
b[sq1]++;
//
black_king_capture(b, n, movelist,sq2,dir);
b[sq1]--;
}
}
else{ // non-promotion
m = SHIFT1|sq2;
move.m[1] = m;
found_cap = 1;
movelist[*n] = move;
b[sq1]++;
//
black_man_capture(b, n, movelist,sq2,-dir);
b[sq1]--;
}
}
}
} // for
if ( !found_cap ) (*n)++;
}
static void white_king_capture( int b[46], int *n, struct move2 movelist[MAXMOVES] ,int j,int in_dir){
//
int m; // auxiliary variable
int temp; // temporary variable
int capsq; // captured square address
int found_cap = 0;
int found_pd;
struct move2 move,orgmove;
int i;
int next_dir;
int dir;
orgmove = movelist[*n];
for ( i = 0; i < 4; i++ ){ // scan all 4 directions
if ( !(in_dir >> (( 3 - i) & 1)) ) continue;
dir = directions[i]; // dir = 4,5,-4,-5.
temp = j; // from square
do temp += dir;while ( !b[temp] );
if ( ( b[temp] & BLACK ) != 0 ){ // /*-----------====================*/
temp = temp + dir;
if ( b[temp] ) continue;
capsq = temp - dir; // fix captured square address in capsq
found_pd = 0;
do{
if ( Test_From_pw(b,temp,dir) ){
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = temp;
m = SHIFT4|temp;
move.m[1] = m;
m = (b[capsq]<<8)|capsq;
move.m[move.l - 1] = m;
found_pd++;
found_cap = 1;
movelist[*n] = move;
b[capsq]--;
// further jumps
switch (i){
case 0:next_dir = ( found_pd == 1 ) ? 13:5;break; // in binary form 1101:0101
case 1:next_dir = ( found_pd == 1 ) ? 14:10;break; // in binary form 1110:1010
case 2:next_dir = ( found_pd == 1 ) ? 7:5;break; // in binary form 0111:0101
case 3:next_dir = ( found_pd == 1 ) ? 11:10;break; // in binary form 1011:1010
}
white_king_capture(b, n, movelist, temp,next_dir);
b[capsq]++;
} // if
temp = temp + dir;
} while ( !b[temp] );
if ( !found_pd ){
if ( (b[temp] & BLACK) != 0 && !b[temp+dir] ){
temp = capsq + dir;
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = temp;
m = SHIFT4|temp;
move.m[1] = m;
m = (b[capsq]<<8)|capsq;
move.m[move.l - 1] = m;
found_cap = 1;
movelist[*n] = move;
b[capsq]--;
// further 1 jump
// next_dir = g_dirs[i]; // 8,4,2,1
switch (i){
case 0:next_dir = 8;break;
case 1:next_dir = 4;break;
case 2:next_dir = 2;break;
case 3:next_dir = 1;break;
}
white_king_capture(b, n, movelist, temp,next_dir);
b[capsq]++;
} // if
else{
temp = capsq + dir;
do{
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = temp;
m = SHIFT4|temp;
move.m[1] = m;
m = (b[capsq]<<8)|capsq;
move.m[move.l - 1] = m;
found_cap = 1;
movelist[*n] = move;
(*n)++;
temp = temp + dir;
} while ( !b[temp] );
}
}
} // /*-----------====================*/
} // for
if ( !found_cap ) (*n)++;
}
static void white_man_capture( int b[46], int *n, struct move2 movelist[MAXMOVES] , int j,int in_dir){
//
int m; // auxiliary variable
int found_cap = 0;
struct move2 move,orgmove;
int i;
int dir;
orgmove = movelist[*n];
for ( i = 0; i < 4; i++ ){ // scan all 4 directions
dir = directions[i]; // dir = 4,5,-4,-5.
if ( dir == in_dir ) continue;
int sq1 = j + dir;
if ( ( b[sq1] & BLACK ) != 0 ){
int sq2 = j + (dir<<1);
if ( !b[sq2] ){
// add to movelist
move = orgmove;
move.l++;
move.path[move.l - 2] = sq2;
m = (b[sq1]<<8)|sq1;
move.m[move.l - 1] = m;
if ( sq2 <= 8 ){ // promotion
m = SHIFT4|sq2;
move.m[1] = m;
found_cap = 1;
movelist[*n] = move;
if ( sq2 == 5 || sq2 == 8 )
(*n)++;
else{
dir = ( dir == -4 ) ? 4:8;
b[sq1]--;
//
white_king_capture(b, n, movelist,sq2,dir);
b[sq1]++;
}
}
else{ // non-promotion
m = SHIFT2|sq2;
move.m[1] = m;
found_cap = 1;
movelist[*n] = move;
b[sq1]--;
//
white_man_capture(b, n, movelist,sq2,-dir);
b[sq1]++;
}
}
}
} // for
if ( !found_cap ) (*n)++;
}
static int Test_From_pb(int b[46], int temp, int dir){
// test if there is capture in perpendicular direction to dir from square
// for black color
int d;
int square;
if ((dir&1) == 0)
d = 5;
else
d = 4;
square = temp;
do{
square = square + d;
}while ( !b[square] );
if ( ( b[square] & WHITE ) != 0 )
if ( !b[square + d] )
return (1);
square = temp;
d = -d; // another perp. direction
do{
square = square + d;
}while ( !b[square] );
if ( ( b[square] & WHITE ) != 0 )
if ( !b[square + d] )
return (1);
return (0);
}
static int Test_From_cb( int b[46],int temp,int dir){
// test if there is capture in current direction dir
// for black color
do{
temp = temp + dir;
}while ( !b[temp] );
if ( ( b[temp] & WHITE ) != 0 )
if ( !b[temp + dir] )
return (1);
return (0);
}
static int Test_From_pw(int b[46],int temp,int dir){
// test if there is capture in perpendicular direction to dir from square
// for white color
int d;
int square;
if ((dir&1) == 0)
d = 5;
else
d = 4;
square = temp;
do{
square = square + d;
}while ( !b[square] );
if ( ( b[square] & BLACK ) != 0 )
if ( !b[square + d] )
return (1);
square = temp;
d = -d; // another perp. direction
do{
square = square + d;
}while ( !b[square] );
if ( ( b[square] & BLACK ) != 0 )
if ( !b[square + d] )
return (1);
return (0);
}
static int Test_From_cw(int b[46],int temp,int dir){
// test if there is capture in current direction dir from square
// for white color
do{
temp = temp + dir;
}while ( !b[temp] );
if ( ( b[temp] & BLACK ) != 0 )
if ( !b[temp + dir] )
return (1);
return (0);
}
static int Test_Capture(int b[46], int color){
//
int i;
int square;
if ( color == BLACK ){
for( i = 1;i <= num_bpieces;i++){
square = p_list[2][i];
if ( !square )
continue;
if ( (b[square] & MAN) != 0 ){
if( (b[square+4] & WHITE) !=0)
if( !b[square+8] )
return(1);
if( (b[square+5] & WHITE) !=0)
if( !b[square+10] )
return(1);
if( (b[square-4] & WHITE) !=0)
if( !b[square-8] )
return(1);
if( (b[square-5] & WHITE) !=0)
if( !b[square-10] )
return(1);
}
else{ // KING
if ( Test_From_cb(b,square,4) ) return (1);
if ( Test_From_cb(b,square,5) ) return (1);
if ( Test_From_cb(b,square,-4) ) return (1);
if ( Test_From_cb(b,square,-5) ) return (1);
}
}
return (0);
} // if ( color == BLACK )
if ( color == WHITE ){
for( i = num_wpieces;i >= 1;i-- ){
square = p_list[1][i];
if ( !square )
continue;
if ( (b[square] & MAN) != 0 ){
if( (b[square+4] & BLACK) !=0)
if( !b[square+8] )
return(1);
if( (b[square+5] & BLACK) !=0)
if( !b[square+10] )
return(1);
if( (b[square-4] & BLACK) !=0)
if( !b[square-8] )
return(1);
if( (b[square-5] & BLACK) !=0)
if( !b[square-10] )
return(1);
}
else{ // KING
if ( Test_From_cw(b,square,4) ) return (1);
if ( Test_From_cw(b,square,5) ) return (1);
if ( Test_From_cw(b,square,-4) ) return (1);
if ( Test_From_cw(b,square,-5) ) return (1);
}
}
return (0);
} // if ( color == WHITE )
return (0);
}