void ChessBoard::generateBishopMoves(ChessBoard& board, int sqSrc, Moves& mvs) { static const int ccBishopDelta[4] = {-34, -30, 30, 34}; static const int ccBishopPin[4] = {-17, -15, 15, 17}; for(int i=0; i<4; i++) { int sqDst = sqSrc + ccBishopDelta[i]; if (!IN_BOARD(sqDst)) continue; int sqPin = sqSrc + ccBishopPin[i]; if (board.m_data[sqPin]) continue; if (SAME_HALF(sqSrc, sqDst)) { if (board.isInBoard(sqDst) && board.canMove(board, sqSrc, sqDst)) { mvs.append(ChessBoard::mv(sqSrc, sqDst)); } } } }
BOOL _PositionStruct::LegalMove(int mv) const { int sqSrc, sqDst, sqPin; int pcSelfSide, pcSrc, pcDst, nDelta; sqSrc = SRC(mv); pcSrc = ucpcSquares[sqSrc]; pcSelfSide = SIDE_TAG(sdPlayer); if ((pcSrc & pcSelfSide) == 0) { return FALSE; } sqDst = DST(mv); pcDst = ucpcSquares[sqDst]; if ((pcDst & pcSelfSide) != 0) { return FALSE; } switch (pcSrc - pcSelfSide) { case PIECE_KING: return IN_FORT(sqDst) && KING_SPAN(sqSrc, sqDst); case PIECE_ADVISOR: return IN_FORT(sqDst) && ADVISOR_SPAN(sqSrc, sqDst); case PIECE_BISHOP: return SAME_HALF(sqSrc, sqDst) && BISHOP_SPAN(sqSrc, sqDst) && ucpcSquares[BISHOP_PIN(sqSrc, sqDst)] == 0; case PIECE_KNIGHT: sqPin = KNIGHT_PIN(sqSrc, sqDst); return sqPin != sqSrc && ucpcSquares[sqPin] == 0; case PIECE_ROOK: case PIECE_CANNON: if (SAME_RANK(sqSrc, sqDst)) { nDelta = (sqDst < sqSrc ? -1 : 1); } else if (SAME_FILE(sqSrc, sqDst)) { nDelta = (sqDst < sqSrc ? -16 : 16); } else { return FALSE; } sqPin = sqSrc + nDelta; while (sqPin != sqDst && ucpcSquares[sqPin] == 0) { sqPin += nDelta; } if (sqPin == sqDst) { return pcDst == 0 || pcSrc - pcSelfSide == PIECE_ROOK; } else if (pcDst != 0 && pcSrc - pcSelfSide == PIECE_CANNON) { sqPin += nDelta; while (sqPin != sqDst && ucpcSquares[sqPin] == 0) { sqPin += nDelta; } return sqPin == sqDst; } else { return FALSE; } case PIECE_PAWN: if (AWAY_HALF(sqDst, sdPlayer) && (sqDst == sqSrc - 1 || sqDst == sqSrc + 1)) { return TRUE; } return sqDst == SQUARE_FORWARD(sqSrc, sdPlayer); default: return FALSE; } }
void PreGenInit(void) { int i, j, k, n, sqSrc, sqDst; RC4Struct rc4; SlideMoveStruct smv; SlideMaskStruct sms; // 首先初始化Zobrist键值表 rc4.InitZero(); PreGen.zobrPlayer.InitRC4(rc4); for (i = 0; i < 14; i ++) { for (j = 0; j < 256; j ++) { PreGen.zobrTable[i][j].InitRC4(rc4); } } // 然后初始化屏蔽位行和屏蔽位列 // 注:位行和位列不包括棋盘以外的位,所以就会频繁使用"+/- RANK_TOP/FILE_LEFT" for (sqSrc = 0; sqSrc < 256; sqSrc ++) { if (IN_BOARD(sqSrc)) { PreGen.wBitRankMask[sqSrc] = 1 << (FILE_X(sqSrc) - FILE_LEFT); PreGen.wBitFileMask[sqSrc] = 1 << (RANK_Y(sqSrc) - RANK_TOP); } else { PreGen.wBitRankMask[sqSrc] = 0; PreGen.wBitFileMask[sqSrc] = 0; } } // 然后生成车炮横向的预置数组(数组的应用参阅"pregen.h") for (i = 0; i < 9; i ++) { for (j = 0; j < 512; j ++) { // 初始化借助于“位行”的车和炮的着法预生成数组,包括以下几个步骤: // 1. 初始化临时变量"SlideMoveTab",假设没有着法,用起始格填充 smv.ucNonCap[0] = smv.ucNonCap[1] = smv.ucRookCap[0] = smv.ucRookCap[1] = smv.ucCannonCap[0] = smv.ucCannonCap[1] = smv.ucSuperCap[0] = smv.ucSuperCap[1] = i + FILE_LEFT; sms.wNonCap = sms.wRookCap = sms.wCannonCap = sms.wSuperCap = 0; // 提示:参阅"pregen.h",...[0]表示最大一格,向右移动和下移动都用[0],反之亦然 // 2. 考虑向右移动的目标格,填充...[0], for (k = i + 1; k <= 8; k ++) { if ((j & (1 << k)) != 0) { smv.ucRookCap[0] = FILE_DISP(k + FILE_LEFT); sms.wRookCap |= 1 << k; break; } smv.ucNonCap[0] = FILE_DISP(k + FILE_LEFT); sms.wNonCap |= 1 << k; } for (k ++; k <= 8; k ++) { if ((j & (1 << k)) != 0) { smv.ucCannonCap[0] = FILE_DISP(k + FILE_LEFT); sms.wCannonCap |= 1 << k; break; } } for (k ++; k <= 8; k ++) { if ((j & (1 << k)) != 0) { smv.ucSuperCap[0] = FILE_DISP(k + FILE_LEFT); sms.wSuperCap |= 1 << k; break; } } // 3. 考虑向左移动的目标格,填充...[1] for (k = i - 1; k >= 0; k --) { if ((j & (1 << k)) != 0) { smv.ucRookCap[1] = FILE_DISP(k + FILE_LEFT); sms.wRookCap |= 1 << k; break; } smv.ucNonCap[1] = FILE_DISP(k + FILE_LEFT); sms.wNonCap |= 1 << k; } for (k --; k >= 0; k --) { if ((j & (1 << k)) != 0) { smv.ucCannonCap[1] = FILE_DISP(k + FILE_LEFT); sms.wCannonCap |= 1 << k; break; } } for (k --; k >= 0; k --) { if ((j & (1 << k)) != 0) { smv.ucSuperCap[1] = FILE_DISP(k + FILE_LEFT); sms.wSuperCap |= 1 << k; break; } } // 4. 为"smv"和"sms"的值作断言 __ASSERT_BOUND_2(3, smv.ucNonCap[1], smv.ucNonCap[0], 11); __ASSERT_BOUND_2(3, smv.ucRookCap[1], smv.ucRookCap[0], 11); __ASSERT_BOUND_2(3, smv.ucCannonCap[1], smv.ucCannonCap[0], 11); __ASSERT_BOUND_2(3, smv.ucSuperCap[1], smv.ucSuperCap[0], 11); __ASSERT_BITRANK(sms.wNonCap); __ASSERT_BITRANK(sms.wRookCap); __ASSERT_BITRANK(sms.wCannonCap); __ASSERT_BITRANK(sms.wSuperCap); // 5. 将临时变量"smv"和"sms"拷贝到着法预生成数组中 PreGen.smvRankMoveTab[i][j] = smv; PreGen.smsRankMaskTab[i][j] = sms; } } // 然后生成车炮纵向的预置数组(数组的应用参阅"pregen.h") for (i = 0; i < 10; i ++) { for (j = 0; j < 1024; j ++) { // 初始化借助于“位列”的车和炮的着法预生成数组,包括以下几个步骤: // 1. 初始化临时变量"smv",假设没有着法,用起始格填充 smv.ucNonCap[0] = smv.ucNonCap[1] = smv.ucRookCap[0] = smv.ucRookCap[1] = smv.ucCannonCap[0] = smv.ucCannonCap[1] = smv.ucSuperCap[0] = smv.ucSuperCap[1] = (i + RANK_TOP) * 16; sms.wNonCap = sms.wRookCap = sms.wCannonCap = sms.wSuperCap = 0; // 2. 考虑向下移动的目标格,填充...[0] for (k = i + 1; k <= 9; k ++) { if ((j & (1 << k)) != 0) { smv.ucRookCap[0] = RANK_DISP(k + RANK_TOP); sms.wRookCap |= 1 << k; break; } smv.ucNonCap[0] = RANK_DISP(k + RANK_TOP); sms.wNonCap |= 1 << k; } for (k ++; k <= 9; k ++) { if ((j & (1 << k)) != 0) { smv.ucCannonCap[0] = RANK_DISP(k + RANK_TOP); sms.wCannonCap |= 1 << k; break; } } for (k ++; k <= 9; k ++) { if ((j & (1 << k)) != 0) { smv.ucSuperCap[0] = RANK_DISP(k + RANK_TOP); sms.wSuperCap |= 1 << k; break; } } // 3. 考虑向上移动的目标格,填充...[1] for (k = i - 1; k >= 0; k --) { if ((j & (1 << k)) != 0) { smv.ucRookCap[1] = RANK_DISP(k + RANK_TOP); sms.wRookCap |= 1 << k; break; } smv.ucNonCap[1] = RANK_DISP(k + RANK_TOP); sms.wNonCap |= 1 << k; } for (k --; k >= 0; k --) { if ((j & (1 << k)) != 0) { smv.ucCannonCap[1] = RANK_DISP(k + RANK_TOP); sms.wCannonCap |= 1 << k; break; } } for (k --; k >= 0; k --) { if ((j & (1 << k)) != 0) { smv.ucSuperCap[1] = RANK_DISP(k + RANK_TOP); sms.wSuperCap |= 1 << k; break; } } // 4. 为"smv"和"sms"的值作断言 __ASSERT_BOUND_2(3, smv.ucNonCap[1] >> 4, smv.ucNonCap[0] >> 4, 12); __ASSERT_BOUND_2(3, smv.ucRookCap[1] >> 4, smv.ucRookCap[0] >> 4, 12); __ASSERT_BOUND_2(3, smv.ucCannonCap[1] >> 4, smv.ucCannonCap[0] >> 4, 12); __ASSERT_BOUND_2(3, smv.ucSuperCap[1] >> 4, smv.ucSuperCap[0] >> 4, 12); __ASSERT_BITFILE(sms.wNonCap); __ASSERT_BITFILE(sms.wRookCap); __ASSERT_BITFILE(sms.wCannonCap); __ASSERT_BITFILE(sms.wSuperCap); // 5. 将临时变量"smv"和"sms"拷贝到着法预生成数组中 PreGen.smvFileMoveTab[i][j] = smv; PreGen.smsFileMaskTab[i][j] = sms; } } // 接下来生成着法预生成数组,连同将军预判数组 for (sqSrc = 0; sqSrc < 256; sqSrc ++) { if (IN_BOARD(sqSrc)) { // 生成帅(将)的着法预生成数组 n = 0; for (i = 0; i < 4; i ++) { sqDst = sqSrc + cnKingMoveTab[i]; if (IN_FORT(sqDst)) { PreGen.ucsqKingMoves[sqSrc][n] = sqDst; n ++; } } __ASSERT(n <= 4); PreGen.ucsqKingMoves[sqSrc][n] = 0; // 生成仕(士)的着法预生成数组 n = 0; for (i = 0; i < 4; i ++) { sqDst = sqSrc + cnAdvisorMoveTab[i]; if (IN_FORT(sqDst)) { PreGen.ucsqAdvisorMoves[sqSrc][n] = sqDst; n ++; } } __ASSERT(n <= 4); PreGen.ucsqAdvisorMoves[sqSrc][n] = 0; // 生成相(象)的着法预生成数组,包括象眼数组 n = 0; for (i = 0; i < 4; i ++) { sqDst = sqSrc + cnBishopMoveTab[i]; if (IN_BOARD(sqDst) && SAME_HALF(sqSrc, sqDst)) { PreGen.ucsqBishopMoves[sqSrc][n] = sqDst; PreGen.ucsqBishopPins[sqSrc][n] = BISHOP_PIN(sqSrc, sqDst); n ++; } } __ASSERT(n <= 4); PreGen.ucsqBishopMoves[sqSrc][n] = 0; // 生成马的着法预生成数组,包括马腿数组 n = 0; for (i = 0; i < 8; i ++) { sqDst = sqSrc + cnKnightMoveTab[i]; if (IN_BOARD(sqDst)) { PreGen.ucsqKnightMoves[sqSrc][n] = sqDst; PreGen.ucsqKnightPins[sqSrc][n] = KNIGHT_PIN(sqSrc, sqDst); n ++; } } __ASSERT(n <= 8); PreGen.ucsqKnightMoves[sqSrc][n] = 0; // 生成兵(卒)的着法预生成数组 for (i = 0; i < 2; i ++) { n = 0; sqDst = SQUARE_FORWARD(sqSrc, i); sqDst = sqSrc + (i == 0 ? -16 : 16); if (IN_BOARD(sqDst)) { PreGen.ucsqPawnMoves[i][sqSrc][n] = sqDst; n ++; } if (AWAY_HALF(sqSrc, i)) { for (j = -1; j <= 1; j += 2) { sqDst = sqSrc + j; if (IN_BOARD(sqDst)) { PreGen.ucsqPawnMoves[i][sqSrc][n] = sqDst; n ++; } } } __ASSERT(n <= 3); PreGen.ucsqPawnMoves[i][sqSrc][n] = 0; } } } // 最后清空局面预评价结构 memset(&PreEval, 0, sizeof(PreEvalStruct)); PreEval.bPromotion = false; // 缺省是不允许升变的 }