-
Notifications
You must be signed in to change notification settings - Fork 12
Expand file tree
/
Copy pathPreGen.cpp
More file actions
534 lines (476 loc) · 15 KB
/
Copy pathPreGen.cpp
File metadata and controls
534 lines (476 loc) · 15 KB
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
#include "stdafx.h"
#include "data.h"
#include "chess.h"
#include "pregen.h"
uint8 _nBoardIndex[256]; //这个要先算出来
uint16 _UpMask[256]; //当前的向上所有的F1111111
uint16 _LoMask[256];
uint16 _RightMask[256];
uint16 _LeftMask[256];
//uint8 _GetDir[512];
uint8 _GetDir[256][256];
uint8 PreKingMove[256][8];
uint8 PreShiXiangAndEyeMove[256][16]; //包括相眼
uint8 PreMaAndLegMove[256][32]; //包括马眼
uint8 PreRPawnMove[256][4]; //0,黑卒,1,红兵'
uint8 PreBPawnMove[256][4]; //0,黑卒,1,红兵
SlideMoveStruct _smvRankMoveTab[9][512];
SlideMoveStruct _smvFileMoveTab[10][1024];
SlideMaskStruct _smsRankMaskTab[9][512]; // 36,864 字节
SlideMaskStruct _smsFileMaskTab[10][1024]; // 81,920 字节
static const int nHorseMoveDir[] = { -33, -31, -18, -14, 14, 18, 31, 33 };
static void InitInBoardData(void){
for(int i = 0; i < 256; i++){
inBoard(i) = 0;
int x = StoX(i);
int y = StoY(i);
if(x > 2 && x < 0xc && y > 2 && y < 0xd){
if(y<8){
inBoard(i) = IN_BSIDE;
}
else{
inBoard(i) = IN_RSIDE;
}
//黑方
if(i == 0x36 || i == 0x38 || i==0x47 || i==0x56 || i==0x58){
inBoard(i) |= IN_BSHI;
}
if(x > 5 && x < 9 && y < 6){
inBoard(i) |= IN_BKING;
}
if(i == 0x35 || i == 0x39 || i==0x53 || i==0x57 || i==0x5b || i==0x75 || i==0x79){
inBoard(i) |= IN_BXIANG;
}
//红方
if(i == 0xa6 || i == 0xa8 || i==0xb7 || i==0xc6 || i==0xc8){
inBoard(i) |= IN_RSHI;
}
if(x > 5 && x < 9 && y > 9){
inBoard(i) |= IN_RKING;
}
if(i == 0xc5 || i == 0xc9 || i==0xa3 || i==0xa7 || i==0xab || i==0x85 || i==0x89){
inBoard(i) |= IN_RXIANG;
}
}
}
}
static void InitMask(void){
//extern uint16 _UpMask[256]; //当前的向上所有的F1111111
//extern uint16 _LoMask[256];
//extern uint16 _RightMask[256];
//extern uint16 _LeftMask[256];
for(int from=0; from<255; from++){
_UpMask[from] = 0;
_LoMask[from] = 0;
_RightMask[from] = 0;
_LeftMask[from] = 0;
if(inBoard(from)){
int x = StoX(from)-3;
int y = StoY(from)-3;
//向上
for(int k=y-1; k>=0; k--){
_UpMask[from] |= 1<<(k);
}
//向下
for(int k=y+1; k<=10; k++){
_LoMask[from] |= 1<<(k);
}
//向左
for(int k=x-1; k>=0; k--){
_LeftMask[from] |= 1<<(k);
}
//向右
for(int k=x+1; k<=9; k++){
_RightMask[from] |= 1<<(k);
}
}
}
}
static void InitPawnMoves(void){
int i, m, n, Player;
uint8* lpDst;
int PawnMoveDir[2][3] = { {-16, -1, 1}, {16, -1, 1} }; // 黑:下左右; 红:上左右
for(Player=0; Player<=1; Player++){
for(m=0x33; m<0xcc; m++){
if(!inBoard(m)){
continue;
}
//lpDst = PrePawnMove[Player][m];
if(Player == WHITE){
lpDst = PreRPawnMove[m];
}
else{
lpDst = PreBPawnMove[m];
}
for(i=0; i<3; i++){
if( i>0 && ((!Player && m>128) || (Player && m<=128)) ){ //未过河的兵不能左右晃动
break;
}
n = m + PawnMoveDir[Player][i];
if(inBoard(n)){
*(lpDst++) = n;
}
}
*lpDst = 0;
}
}
}
static void InitSmvSms(void){
SlideMoveStruct smv;
SlideMaskStruct sms;
int i, j, k;
// 然后生成车炮横向的预置数组(数组的应用参阅"pregen.h")
for (i = 0; i < 9; i ++) {
for (j = 0; j < 512; j ++) {
// 初始化借助于“位行”的车和炮的着法预生成数组,包括以下几个步骤:
// 1. 初始化临时变量"SlideMoveTab",假设没有着法,用起始格填充 //应该用0填充
smv.NonCap[0] = smv.NonCap[1] = smv.RookCap[0] = smv.RookCap[1] =
smv.CannonCap[0] = smv.CannonCap[1] = smv.SuperCap[0] = smv.SuperCap[1] = i + 3;
sms.NonCap = sms.RookCap = sms.CannonCap = sms.SuperCap = 0;
// 提示:参阅"pregen.h",...[0]表示最大一格,向右移动和下移动都用[0],反之亦然
// 2. 考虑向右移动的目标格,填充...[0],
for (k = i + 1; k <= 8; k ++) {
if ((j & (1 << k)) != 0) {
smv.RookCap[0] = k + 3;
sms.RookCap |= 1 << k;
break;
}
smv.NonCap[0] = k + 3;
sms.NonCap |= 1 << k;
}
for (k ++; k <= 8; k ++) {
if ((j & (1 << k)) != 0) {
smv.CannonCap[0] = k + 3;
sms.CannonCap |= 1 << k;
break;
}
}
for (k ++; k <= 8; k ++) {
if ((j & (1 << k)) != 0) {
smv.SuperCap[0] = k + 3;
sms.SuperCap |= 1 << k;
break;
}
}
// 3. 考虑向左移动的目标格,填充...[1]
for (k = i - 1; k >= 0; k --) {
if ((j & (1 << k)) != 0) {
smv.RookCap[1] = k + 3;
sms.RookCap |= 1 << k;
break;
}
smv.NonCap[1] = k + 3;
sms.NonCap |= 1 << k;
}
for (k --; k >= 0; k --) {
if ((j & (1 << k)) != 0) {
smv.CannonCap[1] = k + 3;
sms.CannonCap |= 1 << k;
break;
}
}
for (k --; k >= 0; k --) {
if ((j & (1 << k)) != 0) {
smv.SuperCap[1] = k + 3;
sms.SuperCap |= 1 << k;
break;
}
}
//这儿得合并一下SMS的RookCap与NonCap ***********************************
sms.RookCap |= sms.NonCap;
//再将
// 4. 将临时变量"SlideMoveTab"拷贝到着法预生成数组中
_smvRankMoveTab[i][j] = smv;
_smsRankMaskTab[i][j] = sms;
}
}
// 然后生成车炮纵向的预置数组(数组的应用参阅"pregen.h")
for (i = 0; i < 10; i ++) {
for (j = 0; j < 1024; j ++) {
// 初始化借助于“位列”的车和炮的着法预生成数组,包括以下几个步骤:
// 1. 初始化临时变量"smv",假设没有着法,用起始格填充
smv.NonCap[0] = smv.NonCap[1] = smv.RookCap[0] = smv.RookCap[1] =
smv.CannonCap[0] = smv.CannonCap[1] = smv.SuperCap[0] = smv.SuperCap[1] = (i + 3) * 16;
sms.NonCap = sms.RookCap = sms.CannonCap = sms.SuperCap = 0;
// 2. 考虑向下移动的目标格,填充...[0]
for (k = i + 1; k <= 9; k ++) {
if ((j & (1 << k)) != 0) {
smv.RookCap[0] = (k + 3) * 16;
sms.RookCap |= 1 << k;
break;
}
smv.NonCap[0] = (k + 3) * 16;
sms.NonCap |= 1 << k;
}
for (k ++; k <= 9; k ++) {
if ((j & (1 << k)) != 0) {
smv.CannonCap[0] = (k + 3) * 16;
sms.CannonCap |= 1 << k;
break;
}
}
for (k ++; k <= 9; k ++) {
if ((j & (1 << k)) != 0) {
smv.SuperCap[0] = (k + 3) * 16;
sms.SuperCap |= 1 << k;
break;
}
}
// 3. 考虑向上移动的目标格,填充...[1]
for (k = i - 1; k >= 0; k --) {
if ((j & (1 << k)) != 0) {
smv.RookCap[1] = (k + 3) * 16;
sms.RookCap |= 1 << k;
break;
}
smv.NonCap[1] = (k + 3) * 16;
sms.NonCap |= 1 << k;
}
for (k --; k >= 0; k --) {
if ((j & (1 << k)) != 0) {
smv.CannonCap[1] = (k + 3) * 16;
sms.CannonCap |= 1 << k;
break;
}
}
for (k --; k >= 0; k --) {
if ((j & (1 << k)) != 0) {
smv.SuperCap[1] = (k + 3) * 16;
sms.SuperCap |= 1 << k;
break;
}
}
//这儿得合并一下SMS的RookCap与NonCap ***********************************
sms.RookCap |= sms.NonCap;
// 4. 将临时变量"smv"拷贝到着法预生成数组中
_smvFileMoveTab[i][j] = smv;
_smsFileMaskTab[i][j] = sms;
}
}
}
static void InitShiXiangMove(void){
int m, n;
uint8* lpDst;
//int nBishopMoveDir[] = { -34, -30, 30, 34 };
for(m=0x33; m<0xCC; m++){
lpDst = PreShiXiangAndEyeMove[m];
for(n=0x33; n<0xCC; n++){
//if(IsCanTo(m,n) == DirXiang){ //象可走到
if((inBoard(m) & (IN_RXIANG+IN_BXIANG)) && (inBoard(n) & (IN_RXIANG+IN_BXIANG))){
if(GetDir(m,n) & DirXiang){
*(lpDst++) = n;
*(lpDst++) = (m+n)/2;
}
}
//else if(IsCanTo(m,n) == DirShi){ //士可走到
if((inBoard(m) & (IN_RSHI+IN_BSHI)) && (inBoard(n) & (IN_RSHI+IN_BSHI))){
if(GetDir(m,n) & DirShi){
*(lpDst++) = n;
}
}
}
*lpDst = 0;
}
}
static void InitMaMove(void){
// //PreMaAndLegMoveControlCity
// //PreMaGoodMove[256][32];
//
// // 常数表"cbcEdgeSquares"给定了不利于马的位置,处于棋盘边缘和两个花心位置的马都是坏马
//static const bool cbcEdgeSquares[256] = {
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0,
// 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0,
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
// 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
//};
int i,m,n;
uint8* lpDst;
//uint8* lpDstMaControl;
//uint8* lpDstMaGood;
for(m=0x33; m<0xcc; m++){
if(inBoard(m)){
lpDst = PreMaAndLegMove[m];
//lpDstMaControl = PreMaAndLegMoveControlCity[m];
//lpDstMaGood = PreMaGoodMove[m];
for(i=0; i<8; i++){
n = m + nHorseMoveDir[i];
if(inBoard(n)){ // 马在棋盘内
*(lpDst++) = n;
//再加上马腿哇
*(lpDst++) = m + horseLegTab(n-m+256);
//if(!cbcEdgeSquares[n]){
//*(lpDstMaGood++) = n;
//再加上马腿哇
//*(lpDstMaGood++) = m + horseLegTab(n-m+256);
//}
}
//if(inCity(n)){
// //*(lpDstMaControl++) = n;
// //再加上马腿哇
// //*(lpDstMaControl++) = m + horseLegTab(n-m+256);
//}
}
*lpDst = 0;
//*lpDstMaControl = 0;
//*lpDstMaGood = 0;
}
}
}
static void InitKingMoves(void){
uint8* lpDst;
int i,m,n;
int nKingMoveDir[4] = { -16, -1, 1, 16 };
for(m=0x36; m<0xc9; m++){ //将帅可能的位置
if(inBoard(m) &(IN_RKING|IN_BKING)){
lpDst = PreKingMove[m];
for(i=0; i<4; i++){
n = m + nKingMoveDir[i];
if(inBoard(n) & (IN_RKING|IN_BKING)){
*(lpDst++) = n;
}
}
*lpDst = 0; // 表示不能再移动
}
}
}
static void InitDirInfo(void){
//for(int from = 0; from < 256; from++){
// _GetDir[i] = DirNone;
//}
int size = sizeof(_GetDir);
memset(_GetDir,DirNone,size);
for(int from = 0x33; from < 0xcc; from++){
for(int to = 0x33; to < 0xcc; to++){
//int dir = from-to+256;
int fx = StoX(from);
int fy = StoY(from);
int tx = StoX(to);
int ty = StoY(to);
//士
if((inBoard(from) & (IN_RSHI+IN_BSHI)) && (inBoard(to) & (IN_RSHI+IN_BSHI))){
if(ABS(fx-tx) == 1 && ABS(fy-ty) == 1){
_GetDir[from][to] |= DirShi;
}
}
//相
if((inBoard(from) & (IN_RXIANG+IN_BXIANG)) && (inBoard(to) & (IN_RXIANG+IN_BXIANG))){
if(ABS(fx-tx) == 2 && ABS(fy-ty) == 2){
_GetDir[from][to] |= DirXiang;
}
}
//马
if((inBoard(from)) && (inBoard(to))){
if( (ABS(fx-tx) == 1 && ABS(fy-ty) == 2)
||(ABS(fx-tx) == 2 && ABS(fy-ty) == 1)){
_GetDir[from][to] |= DirMa;
}
}
//将兵
if((inBoard(from)) && (inBoard(to))){
if( (ABS(fx-tx) == 1 && ABS(fy-ty) == 0)
||(ABS(fx-tx) == 0 && ABS(fy-ty) == 1)){
_GetDir[from][to] |= DirKing;
}
}
//车炮
if((inBoard(from)) && (inBoard(to))){
if(fx == tx){
if(fy<ty){ //是不是在上面
_GetDir[from][to] |= DirUp;
}
else if(fy>ty){ //是不是在下面
_GetDir[from][to] |= DirLow;
}
}
else if(fy == ty){
if(fx<tx){ //是不是在左面
_GetDir[from][to] |= DirLeft;
}
else if(fx>tx){ //是不是在右面
_GetDir[from][to] |= DirRight;
}
}
}
}
}
}
void //初始化历史走步名称
initHisMoveName(dispboard_t* pDis){
//extern char DispHisMoveName[7000];
//extern int DispHisMove[500];
//char DispHisMoveName[7000];
//char* DispHisMove[500];
//BCHEYU[from] = &BCHEYU090[esi]; //取得地址
TCHAR* pc;
for(int i=0; i<MAX_GAME_LENGTH; i++){
//DispHisMove[i] = &DispHisMoveName[i*14];
//pc = DispHisMove[i];
//pc = &DIS.pos.moveListName[i*14];
pc = pDis->moveListName[i];
int ti = (i+2)/2;
if(ti < 100){
*pc = 0x30;
}
else{
char k = ti /100;
*pc = k+48;
ti -= 100 * k;
}
pc++;
if(ti < 10){
*pc = 0x30;
}
else{
char k= ti /10;
*pc = k+48;
ti -= 10*k;
}
pc++;
*pc = ti+48;
pc++;
for( int e=0; e<10; e++){
*(pc+e) = 0x20;
}
//=============================================
if(i%2 == 1){
pc = pDis->moveListName[i];
*pc++ = 95;
*pc++ = 95;
*pc++ = 95;
}
//=============================================
}
//======================================
//for(int i=0; i<500; i++)
//{
// pc = DispHisMove[i];
// DispLog(pc);
//}
}
void initPreGen(void){
p90ToAsc();
InitInBoardData();
InitMask();
InitDirInfo();
InitSmvSms(); //包括车炮
//走步
InitMaMove(); //马
InitKingMoves(); //将
InitPawnMoves(); //兵
InitShiXiangMove(); //十相
init_mersenne();
init_zobrist(); //初始化hash key
initHisMoveName(OBS[0]);
}