2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2009 Marco Costalba
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
36 #include "ucioption.h"
45 int Position::castleRightsMask[64];
47 Key Position::zobrist[2][8][64];
48 Key Position::zobEp[64];
49 Key Position::zobCastle[16];
50 Key Position::zobMaterial[2][8][16];
51 Key Position::zobSideToMove;
53 Value Position::MgPieceSquareTable[16][64];
54 Value Position::EgPieceSquareTable[16][64];
56 static bool RequestPending = false;
64 Position::Position(const Position& pos) {
68 Position::Position(const string& fen) {
73 /// Position::from_fen() initializes the position object with the given FEN
74 /// string. This function is not very robust - make sure that input FENs are
75 /// correct (this is assumed to be the responsibility of the GUI).
77 void Position::from_fen(const string& fen) {
79 static const string pieceLetters = "KQRBNPkqrbnp";
80 static const Piece pieces[] = { WK, WQ, WR, WB, WN, WP, BK, BQ, BR, BB, BN, BP };
88 for ( ; fen[i] != ' '; i++)
92 // Skip the given number of files
93 file += (fen[i] - '1' + 1);
96 else if (fen[i] == '/')
102 size_t idx = pieceLetters.find(fen[i]);
103 if (idx == string::npos)
105 std::cout << "Error in FEN at character " << i << std::endl;
108 Square square = make_square(file, rank);
109 put_piece(pieces[idx], square);
115 if (fen[i] != 'w' && fen[i] != 'b')
117 std::cout << "Error in FEN at character " << i << std::endl;
120 sideToMove = (fen[i] == 'w' ? WHITE : BLACK);
126 std::cout << "Error in FEN at character " << i << std::endl;
131 while(strchr("KQkqabcdefghABCDEFGH-", fen[i])) {
137 else if(fen[i] == 'K') allow_oo(WHITE);
138 else if(fen[i] == 'Q') allow_ooo(WHITE);
139 else if(fen[i] == 'k') allow_oo(BLACK);
140 else if(fen[i] == 'q') allow_ooo(BLACK);
141 else if(fen[i] >= 'A' && fen[i] <= 'H') {
142 File rookFile, kingFile = FILE_NONE;
143 for(Square square = SQ_B1; square <= SQ_G1; square++)
144 if(piece_on(square) == WK)
145 kingFile = square_file(square);
146 if(kingFile == FILE_NONE) {
147 std::cout << "Error in FEN at character " << i << std::endl;
150 initialKFile = kingFile;
151 rookFile = File(fen[i] - 'A') + FILE_A;
152 if(rookFile < initialKFile) {
154 initialQRFile = rookFile;
158 initialKRFile = rookFile;
161 else if(fen[i] >= 'a' && fen[i] <= 'h') {
162 File rookFile, kingFile = FILE_NONE;
163 for(Square square = SQ_B8; square <= SQ_G8; square++)
164 if(piece_on(square) == BK)
165 kingFile = square_file(square);
166 if(kingFile == FILE_NONE) {
167 std::cout << "Error in FEN at character " << i << std::endl;
170 initialKFile = kingFile;
171 rookFile = File(fen[i] - 'a') + FILE_A;
172 if(rookFile < initialKFile) {
174 initialQRFile = rookFile;
178 initialKRFile = rookFile;
182 std::cout << "Error in FEN at character " << i << std::endl;
189 while (fen[i] == ' ')
193 if ( i <= fen.length() - 2
194 && (fen[i] >= 'a' && fen[i] <= 'h')
195 && (fen[i+1] == '3' || fen[i+1] == '6'))
196 st->epSquare = square_from_string(fen.substr(i, 2));
198 // Various initialisation
199 for (Square sq = SQ_A1; sq <= SQ_H8; sq++)
200 castleRightsMask[sq] = ALL_CASTLES;
202 castleRightsMask[make_square(initialKFile, RANK_1)] ^= (WHITE_OO|WHITE_OOO);
203 castleRightsMask[make_square(initialKFile, RANK_8)] ^= (BLACK_OO|BLACK_OOO);
204 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
205 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
206 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
207 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
211 st->key = compute_key();
212 st->pawnKey = compute_pawn_key();
213 st->materialKey = compute_material_key();
214 st->mgValue = compute_value<MidGame>();
215 st->egValue = compute_value<EndGame>();
216 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
217 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
221 /// Position::to_fen() converts the position object to a FEN string. This is
222 /// probably only useful for debugging.
224 const string Position::to_fen() const {
226 static const string pieceLetters = " PNBRQK pnbrqk";
230 for (Rank rank = RANK_8; rank >= RANK_1; rank--)
233 for (File file = FILE_A; file <= FILE_H; file++)
235 Square sq = make_square(file, rank);
236 if (!square_is_occupied(sq))
242 fen += (char)skip + '0';
245 fen += pieceLetters[piece_on(sq)];
248 fen += (char)skip + '0';
250 fen += (rank > RANK_1 ? '/' : ' ');
252 fen += (sideToMove == WHITE ? "w " : "b ");
253 if (st->castleRights != NO_CASTLES)
255 if (can_castle_kingside(WHITE)) fen += 'K';
256 if (can_castle_queenside(WHITE)) fen += 'Q';
257 if (can_castle_kingside(BLACK)) fen += 'k';
258 if (can_castle_queenside(BLACK)) fen += 'q';
263 if (ep_square() != SQ_NONE)
264 fen += square_to_string(ep_square());
272 /// Position::print() prints an ASCII representation of the position to
273 /// the standard output. If a move is given then also the san is print.
275 void Position::print(Move m) const {
277 static const string pieceLetters = " PNBRQK PNBRQK .";
279 // Check for reentrancy, as example when called from inside
280 // MovePicker that is used also here in move_to_san()
284 RequestPending = true;
286 std::cout << std::endl;
289 string col = (color_of_piece_on(move_from(m)) == BLACK ? ".." : "");
290 std::cout << "Move is: " << col << move_to_san(*this, m) << std::endl;
292 for (Rank rank = RANK_8; rank >= RANK_1; rank--)
294 std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
295 for (File file = FILE_A; file <= FILE_H; file++)
297 Square sq = make_square(file, rank);
298 Piece piece = piece_on(sq);
299 if (piece == EMPTY && square_color(sq) == WHITE)
302 char col = (color_of_piece_on(sq) == BLACK ? '=' : ' ');
303 std::cout << '|' << col << pieceLetters[piece] << col;
305 std::cout << '|' << std::endl;
307 std::cout << "+---+---+---+---+---+---+---+---+" << std::endl
308 << "Fen is: " << to_fen() << std::endl
309 << "Key is: " << st->key << std::endl;
311 RequestPending = false;
315 /// Position::copy() creates a copy of the input position.
317 void Position::copy(const Position &pos) {
319 memcpy(this, &pos, sizeof(Position));
323 /// Position:hidden_checkers<>() returns a bitboard of all pinned (against the
324 /// king) pieces for the given color and for the given pinner type. Or, when
325 /// template parameter FindPinned is false, the pieces of the given color
326 /// candidate for a discovery check against the enemy king.
327 /// Note that checkersBB bitboard must be already updated.
329 template<bool FindPinned>
330 Bitboard Position::hidden_checkers(Color c) const {
332 Bitboard pinners, result = EmptyBoardBB;
334 // Pinned pieces protect our king, dicovery checks attack
336 Square ksq = king_square(FindPinned ? c : opposite_color(c));
338 // Pinners are sliders, not checkers, that give check when
339 // candidate pinned is removed.
340 pinners = (rooks_and_queens(FindPinned ? opposite_color(c) : c) & RookPseudoAttacks[ksq])
341 | (bishops_and_queens(FindPinned ? opposite_color(c) : c) & BishopPseudoAttacks[ksq]);
343 if (FindPinned && pinners)
344 pinners &= ~st->checkersBB;
348 Square s = pop_1st_bit(&pinners);
349 Bitboard b = squares_between(s, ksq) & occupied_squares();
353 if ( !(b & (b - 1)) // Only one bit set?
354 && (b & pieces_of_color(c))) // Is an our piece?
361 /// Position:pinned_pieces() returns a bitboard of all pinned (against the
362 /// king) pieces for the given color.
364 Bitboard Position::pinned_pieces(Color c) const {
366 return hidden_checkers<true>(c);
370 /// Position:discovered_check_candidates() returns a bitboard containing all
371 /// pieces for the given side which are candidates for giving a discovered
374 Bitboard Position::discovered_check_candidates(Color c) const {
376 return hidden_checkers<false>(c);
379 /// Position::attacks_to() computes a bitboard containing all pieces which
380 /// attacks a given square.
382 Bitboard Position::attacks_to(Square s) const {
384 return (pawn_attacks(BLACK, s) & pawns(WHITE))
385 | (pawn_attacks(WHITE, s) & pawns(BLACK))
386 | (piece_attacks<KNIGHT>(s) & pieces_of_type(KNIGHT))
387 | (piece_attacks<ROOK>(s) & rooks_and_queens())
388 | (piece_attacks<BISHOP>(s) & bishops_and_queens())
389 | (piece_attacks<KING>(s) & pieces_of_type(KING));
392 /// Position::piece_attacks_square() tests whether the piece on square f
393 /// attacks square t.
395 bool Position::piece_attacks_square(Piece p, Square f, Square t) const {
397 assert(square_is_ok(f));
398 assert(square_is_ok(t));
402 case WP: return pawn_attacks_square(WHITE, f, t);
403 case BP: return pawn_attacks_square(BLACK, f, t);
404 case WN: case BN: return piece_attacks_square<KNIGHT>(f, t);
405 case WB: case BB: return piece_attacks_square<BISHOP>(f, t);
406 case WR: case BR: return piece_attacks_square<ROOK>(f, t);
407 case WQ: case BQ: return piece_attacks_square<QUEEN>(f, t);
408 case WK: case BK: return piece_attacks_square<KING>(f, t);
415 /// Position::move_attacks_square() tests whether a move from the current
416 /// position attacks a given square.
418 bool Position::move_attacks_square(Move m, Square s) const {
420 assert(move_is_ok(m));
421 assert(square_is_ok(s));
423 Square f = move_from(m), t = move_to(m);
425 assert(square_is_occupied(f));
427 if (piece_attacks_square(piece_on(f), t, s))
430 // Move the piece and scan for X-ray attacks behind it
431 Bitboard occ = occupied_squares();
432 Color us = color_of_piece_on(f);
435 Bitboard xray = ( (rook_attacks_bb(s, occ) & rooks_and_queens())
436 |(bishop_attacks_bb(s, occ) & bishops_and_queens())) & pieces_of_color(us);
438 // If we have attacks we need to verify that are caused by our move
439 // and are not already existent ones.
440 return xray && (xray ^ (xray & piece_attacks<QUEEN>(s)));
444 /// Position::find_checkers() computes the checkersBB bitboard, which
445 /// contains a nonzero bit for each checking piece (0, 1 or 2). It
446 /// currently works by calling Position::attacks_to, which is probably
447 /// inefficient. Consider rewriting this function to use the last move
448 /// played, like in non-bitboard versions of Glaurung.
450 void Position::find_checkers() {
452 Color us = side_to_move();
453 st->checkersBB = attacks_to(king_square(us), opposite_color(us));
457 /// Position::pl_move_is_legal() tests whether a pseudo-legal move is legal
459 bool Position::pl_move_is_legal(Move m) const {
461 // If we're in check, all pseudo-legal moves are legal, because our
462 // check evasion generator only generates true legal moves.
463 return is_check() || pl_move_is_legal(m, pinned_pieces(side_to_move()));
466 bool Position::pl_move_is_legal(Move m, Bitboard pinned) const {
469 assert(move_is_ok(m));
470 assert(pinned == pinned_pieces(side_to_move()));
473 // Castling moves are checked for legality during move generation.
474 if (move_is_castle(m))
477 Color us = side_to_move();
478 Square from = move_from(m);
479 Square ksq = king_square(us);
481 assert(color_of_piece_on(from) == us);
482 assert(piece_on(ksq) == piece_of_color_and_type(us, KING));
484 // En passant captures are a tricky special case. Because they are
485 // rather uncommon, we do it simply by testing whether the king is attacked
486 // after the move is made
489 Color them = opposite_color(us);
490 Square to = move_to(m);
491 Square capsq = make_square(square_file(to), square_rank(from));
492 Bitboard b = occupied_squares();
494 assert(to == ep_square());
495 assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
496 assert(piece_on(capsq) == piece_of_color_and_type(them, PAWN));
497 assert(piece_on(to) == EMPTY);
500 clear_bit(&b, capsq);
503 return !(rook_attacks_bb(ksq, b) & rooks_and_queens(them))
504 && !(bishop_attacks_bb(ksq, b) & bishops_and_queens(them));
507 // If the moving piece is a king, check whether the destination
508 // square is attacked by the opponent.
510 return !(square_is_attacked(move_to(m), opposite_color(us)));
512 // A non-king move is legal if and only if it is not pinned or it
513 // is moving along the ray towards or away from the king.
515 || !bit_is_set(pinned, from)
516 || (direction_between_squares(from, ksq) == direction_between_squares(move_to(m), ksq)));
520 /// Position::move_is_check() tests whether a pseudo-legal move is a check
522 bool Position::move_is_check(Move m) const {
524 Bitboard dc = discovered_check_candidates(side_to_move());
525 return move_is_check(m, dc);
528 bool Position::move_is_check(Move m, Bitboard dcCandidates) const {
531 assert(move_is_ok(m));
532 assert(dcCandidates == discovered_check_candidates(side_to_move()));
534 Color us = side_to_move();
535 Color them = opposite_color(us);
536 Square from = move_from(m);
537 Square to = move_to(m);
538 Square ksq = king_square(them);
540 assert(color_of_piece_on(from) == us);
541 assert(piece_on(ksq) == piece_of_color_and_type(them, KING));
543 // Proceed according to the type of the moving piece
544 switch (type_of_piece_on(from))
548 if (bit_is_set(pawn_attacks(them, ksq), to)) // Normal check?
551 if ( dcCandidates // Discovered check?
552 && bit_is_set(dcCandidates, from)
553 && (direction_between_squares(from, ksq) != direction_between_squares(to, ksq)))
556 if (move_promotion(m)) // Promotion with check?
558 Bitboard b = occupied_squares();
561 switch (move_promotion(m))
564 return bit_is_set(piece_attacks<KNIGHT>(to), ksq);
566 return bit_is_set(bishop_attacks_bb(to, b), ksq);
568 return bit_is_set(rook_attacks_bb(to, b), ksq);
570 return bit_is_set(queen_attacks_bb(to, b), ksq);
575 // En passant capture with check? We have already handled the case
576 // of direct checks and ordinary discovered check, the only case we
577 // need to handle is the unusual case of a discovered check through the
579 else if (move_is_ep(m))
581 Square capsq = make_square(square_file(to), square_rank(from));
582 Bitboard b = occupied_squares();
584 clear_bit(&b, capsq);
586 return (rook_attacks_bb(ksq, b) & rooks_and_queens(us))
587 ||(bishop_attacks_bb(ksq, b) & bishops_and_queens(us));
591 // Test discovered check and normal check according to piece type
593 return (dcCandidates && bit_is_set(dcCandidates, from))
594 || bit_is_set(piece_attacks<KNIGHT>(ksq), to);
597 return (dcCandidates && bit_is_set(dcCandidates, from))
598 || (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to));
601 return (dcCandidates && bit_is_set(dcCandidates, from))
602 || (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to));
605 // Discovered checks are impossible!
606 assert(!bit_is_set(dcCandidates, from));
607 return ( (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to))
608 || (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to)));
612 if ( bit_is_set(dcCandidates, from)
613 && (direction_between_squares(from, ksq) != direction_between_squares(to, ksq)))
616 // Castling with check?
617 if (move_is_castle(m))
619 Square kfrom, kto, rfrom, rto;
620 Bitboard b = occupied_squares();
626 kto = relative_square(us, SQ_G1);
627 rto = relative_square(us, SQ_F1);
629 kto = relative_square(us, SQ_C1);
630 rto = relative_square(us, SQ_D1);
632 clear_bit(&b, kfrom);
633 clear_bit(&b, rfrom);
636 return bit_is_set(rook_attacks_bb(rto, b), ksq);
640 default: // NO_PIECE_TYPE
648 /// Position::update_checkers() udpates chekers info given the move. It is called
649 /// in do_move() and is faster then find_checkers().
651 template<PieceType Piece>
652 inline void Position::update_checkers(Bitboard* pCheckersBB, Square ksq, Square from,
653 Square to, Bitboard dcCandidates) {
655 const bool Bishop = (Piece == QUEEN || Piece == BISHOP);
656 const bool Rook = (Piece == QUEEN || Piece == ROOK);
657 const bool Slider = Bishop || Rook;
660 if ( ( (Bishop && bit_is_set(BishopPseudoAttacks[ksq], to))
661 || (Rook && bit_is_set(RookPseudoAttacks[ksq], to)))
662 && bit_is_set(piece_attacks<Piece>(ksq), to)) // slow, try to early skip
663 set_bit(pCheckersBB, to);
665 else if ( Piece != KING
667 && bit_is_set(piece_attacks<Piece>(ksq), to))
668 set_bit(pCheckersBB, to);
671 if (Piece != QUEEN && bit_is_set(dcCandidates, from))
674 (*pCheckersBB) |= (piece_attacks<ROOK>(ksq) & rooks_and_queens(side_to_move()));
677 (*pCheckersBB) |= (piece_attacks<BISHOP>(ksq) & bishops_and_queens(side_to_move()));
682 /// Position::do_move() makes a move, and saves all information necessary
683 /// to a StateInfo object. The move is assumed to be legal.
684 /// Pseudo-legal moves should be filtered out before this function is called.
686 void Position::do_move(Move m, StateInfo& newSt) {
688 do_move(m, newSt, discovered_check_candidates(side_to_move()));
691 void Position::do_move(Move m, StateInfo& newSt, Bitboard dcCandidates) {
694 assert(move_is_ok(m));
696 // Copy some fields of old state to our new StateInfo object except the
697 // ones which are recalculated from scratch anyway, then switch our state
698 // pointer to point to the new, ready to be updated, state.
699 struct ReducedStateInfo {
700 Key key, pawnKey, materialKey;
701 int castleRights, rule50;
703 Value mgValue, egValue;
707 memcpy(&newSt, st, sizeof(ReducedStateInfo));
708 newSt.capture = NO_PIECE_TYPE;
712 // Save the current key to the history[] array, in order to be able to
713 // detect repetition draws.
714 history[gamePly] = st->key;
716 // Increment the 50 moves rule draw counter. Resetting it to zero in the
717 // case of non-reversible moves is taken care of later.
720 if (move_is_castle(m))
722 else if (move_promotion(m))
723 do_promotion_move(m);
724 else if (move_is_ep(m))
728 Color us = side_to_move();
729 Color them = opposite_color(us);
730 Square from = move_from(m);
731 Square to = move_to(m);
733 assert(color_of_piece_on(from) == us);
734 assert(color_of_piece_on(to) == them || piece_on(to) == EMPTY);
736 PieceType piece = type_of_piece_on(from);
738 st->capture = type_of_piece_on(to);
741 do_capture_move(st->capture, them, to);
744 Bitboard move_bb = make_move_bb(from, to);
745 do_move_bb(&(byColorBB[us]), move_bb);
746 do_move_bb(&(byTypeBB[piece]), move_bb);
747 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
749 board[to] = board[from];
753 st->key ^= zobrist[us][piece][from] ^ zobrist[us][piece][to];
755 // Update incremental scores
756 st->mgValue -= pst<MidGame>(us, piece, from);
757 st->mgValue += pst<MidGame>(us, piece, to);
758 st->egValue -= pst<EndGame>(us, piece, from);
759 st->egValue += pst<EndGame>(us, piece, to);
761 // If the moving piece was a king, update the king square
765 // Reset en passant square
766 if (st->epSquare != SQ_NONE)
768 st->key ^= zobEp[st->epSquare];
769 st->epSquare = SQ_NONE;
772 // If the moving piece was a pawn do some special extra work
775 // Reset rule 50 draw counter
778 // Update pawn hash key
779 st->pawnKey ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
781 // Set en passant square, only if moved pawn can be captured
782 if (abs(int(to) - int(from)) == 16)
784 if ( (us == WHITE && (pawn_attacks(WHITE, from + DELTA_N) & pawns(BLACK)))
785 || (us == BLACK && (pawn_attacks(BLACK, from + DELTA_S) & pawns(WHITE))))
787 st->epSquare = Square((int(from) + int(to)) / 2);
788 st->key ^= zobEp[st->epSquare];
793 // Update piece lists
794 pieceList[us][piece][index[from]] = to;
795 index[to] = index[from];
797 // Update castle rights
798 st->key ^= zobCastle[st->castleRights];
799 st->castleRights &= castleRightsMask[from];
800 st->castleRights &= castleRightsMask[to];
801 st->key ^= zobCastle[st->castleRights];
803 // Update checkers bitboard, piece must be already moved
804 st->checkersBB = EmptyBoardBB;
805 Square ksq = king_square(them);
808 case PAWN: update_checkers<PAWN>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
809 case KNIGHT: update_checkers<KNIGHT>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
810 case BISHOP: update_checkers<BISHOP>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
811 case ROOK: update_checkers<ROOK>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
812 case QUEEN: update_checkers<QUEEN>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
813 case KING: update_checkers<KING>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
814 default: assert(false); break;
819 st->key ^= zobSideToMove;
820 sideToMove = opposite_color(sideToMove);
823 st->mgValue += (sideToMove == WHITE)? TempoValueMidgame : -TempoValueMidgame;
824 st->egValue += (sideToMove == WHITE)? TempoValueEndgame : -TempoValueEndgame;
830 /// Position::do_capture_move() is a private method used to update captured
831 /// piece info. It is called from the main Position::do_move function.
833 void Position::do_capture_move(PieceType capture, Color them, Square to) {
835 assert(capture != KING);
837 // Remove captured piece
838 clear_bit(&(byColorBB[them]), to);
839 clear_bit(&(byTypeBB[capture]), to);
840 clear_bit(&(byTypeBB[0]), to);
843 st->key ^= zobrist[them][capture][to];
845 // If the captured piece was a pawn, update pawn hash key
847 st->pawnKey ^= zobrist[them][PAWN][to];
849 // Update incremental scores
850 st->mgValue -= pst<MidGame>(them, capture, to);
851 st->egValue -= pst<EndGame>(them, capture, to);
855 st->npMaterial[them] -= piece_value_midgame(capture);
857 // Update material hash key
858 st->materialKey ^= zobMaterial[them][capture][pieceCount[them][capture]];
860 // Update piece count
861 pieceCount[them][capture]--;
864 pieceList[them][capture][index[to]] = pieceList[them][capture][pieceCount[them][capture]];
865 index[pieceList[them][capture][index[to]]] = index[to];
867 // Reset rule 50 counter
872 /// Position::do_castle_move() is a private method used to make a castling
873 /// move. It is called from the main Position::do_move function. Note that
874 /// castling moves are encoded as "king captures friendly rook" moves, for
875 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
877 void Position::do_castle_move(Move m) {
880 assert(move_is_ok(m));
881 assert(move_is_castle(m));
883 Color us = side_to_move();
884 Color them = opposite_color(us);
886 // Find source squares for king and rook
887 Square kfrom = move_from(m);
888 Square rfrom = move_to(m); // HACK: See comment at beginning of function
891 assert(piece_on(kfrom) == piece_of_color_and_type(us, KING));
892 assert(piece_on(rfrom) == piece_of_color_and_type(us, ROOK));
894 // Find destination squares for king and rook
895 if (rfrom > kfrom) // O-O
897 kto = relative_square(us, SQ_G1);
898 rto = relative_square(us, SQ_F1);
900 kto = relative_square(us, SQ_C1);
901 rto = relative_square(us, SQ_D1);
904 // Remove pieces from source squares
905 clear_bit(&(byColorBB[us]), kfrom);
906 clear_bit(&(byTypeBB[KING]), kfrom);
907 clear_bit(&(byTypeBB[0]), kfrom); // HACK: byTypeBB[0] == occupied squares
908 clear_bit(&(byColorBB[us]), rfrom);
909 clear_bit(&(byTypeBB[ROOK]), rfrom);
910 clear_bit(&(byTypeBB[0]), rfrom); // HACK: byTypeBB[0] == occupied squares
912 // Put pieces on destination squares
913 set_bit(&(byColorBB[us]), kto);
914 set_bit(&(byTypeBB[KING]), kto);
915 set_bit(&(byTypeBB[0]), kto); // HACK: byTypeBB[0] == occupied squares
916 set_bit(&(byColorBB[us]), rto);
917 set_bit(&(byTypeBB[ROOK]), rto);
918 set_bit(&(byTypeBB[0]), rto); // HACK: byTypeBB[0] == occupied squares
920 // Update board array
921 board[kfrom] = board[rfrom] = EMPTY;
922 board[kto] = piece_of_color_and_type(us, KING);
923 board[rto] = piece_of_color_and_type(us, ROOK);
925 // Update king square
926 kingSquare[us] = kto;
928 // Update piece lists
929 pieceList[us][KING][index[kfrom]] = kto;
930 pieceList[us][ROOK][index[rfrom]] = rto;
931 int tmp = index[rfrom];
932 index[kto] = index[kfrom];
935 // Update incremental scores
936 st->mgValue -= pst<MidGame>(us, KING, kfrom);
937 st->mgValue += pst<MidGame>(us, KING, kto);
938 st->egValue -= pst<EndGame>(us, KING, kfrom);
939 st->egValue += pst<EndGame>(us, KING, kto);
940 st->mgValue -= pst<MidGame>(us, ROOK, rfrom);
941 st->mgValue += pst<MidGame>(us, ROOK, rto);
942 st->egValue -= pst<EndGame>(us, ROOK, rfrom);
943 st->egValue += pst<EndGame>(us, ROOK, rto);
946 st->key ^= zobrist[us][KING][kfrom] ^ zobrist[us][KING][kto];
947 st->key ^= zobrist[us][ROOK][rfrom] ^ zobrist[us][ROOK][rto];
949 // Clear en passant square
950 if (st->epSquare != SQ_NONE)
952 st->key ^= zobEp[st->epSquare];
953 st->epSquare = SQ_NONE;
956 // Update castling rights
957 st->key ^= zobCastle[st->castleRights];
958 st->castleRights &= castleRightsMask[kfrom];
959 st->key ^= zobCastle[st->castleRights];
961 // Reset rule 50 counter
964 // Update checkers BB
965 st->checkersBB = attacks_to(king_square(them), us);
969 /// Position::do_promotion_move() is a private method used to make a promotion
970 /// move. It is called from the main Position::do_move function.
972 void Position::do_promotion_move(Move m) {
979 assert(move_is_ok(m));
980 assert(move_promotion(m));
983 them = opposite_color(us);
987 assert(relative_rank(us, to) == RANK_8);
988 assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
989 assert(color_of_piece_on(to) == them || square_is_empty(to));
991 st->capture = type_of_piece_on(to);
994 do_capture_move(st->capture, them, to);
997 clear_bit(&(byColorBB[us]), from);
998 clear_bit(&(byTypeBB[PAWN]), from);
999 clear_bit(&(byTypeBB[0]), from); // HACK: byTypeBB[0] == occupied squares
1000 board[from] = EMPTY;
1002 // Insert promoted piece
1003 promotion = move_promotion(m);
1004 assert(promotion >= KNIGHT && promotion <= QUEEN);
1005 set_bit(&(byColorBB[us]), to);
1006 set_bit(&(byTypeBB[promotion]), to);
1007 set_bit(&(byTypeBB[0]), to); // HACK: byTypeBB[0] == occupied squares
1008 board[to] = piece_of_color_and_type(us, promotion);
1011 st->key ^= zobrist[us][PAWN][from] ^ zobrist[us][promotion][to];
1013 // Update pawn hash key
1014 st->pawnKey ^= zobrist[us][PAWN][from];
1016 // Update material key
1017 st->materialKey ^= zobMaterial[us][PAWN][pieceCount[us][PAWN]];
1018 st->materialKey ^= zobMaterial[us][promotion][pieceCount[us][promotion]+1];
1020 // Update piece counts
1021 pieceCount[us][PAWN]--;
1022 pieceCount[us][promotion]++;
1024 // Update piece lists
1025 pieceList[us][PAWN][index[from]] = pieceList[us][PAWN][pieceCount[us][PAWN]];
1026 index[pieceList[us][PAWN][index[from]]] = index[from];
1027 pieceList[us][promotion][pieceCount[us][promotion] - 1] = to;
1028 index[to] = pieceCount[us][promotion] - 1;
1030 // Update incremental scores
1031 st->mgValue -= pst<MidGame>(us, PAWN, from);
1032 st->mgValue += pst<MidGame>(us, promotion, to);
1033 st->egValue -= pst<EndGame>(us, PAWN, from);
1034 st->egValue += pst<EndGame>(us, promotion, to);
1037 st->npMaterial[us] += piece_value_midgame(promotion);
1039 // Clear the en passant square
1040 if (st->epSquare != SQ_NONE)
1042 st->key ^= zobEp[st->epSquare];
1043 st->epSquare = SQ_NONE;
1046 // Update castle rights
1047 st->key ^= zobCastle[st->castleRights];
1048 st->castleRights &= castleRightsMask[to];
1049 st->key ^= zobCastle[st->castleRights];
1051 // Reset rule 50 counter
1054 // Update checkers BB
1055 st->checkersBB = attacks_to(king_square(them), us);
1059 /// Position::do_ep_move() is a private method used to make an en passant
1060 /// capture. It is called from the main Position::do_move function.
1062 void Position::do_ep_move(Move m) {
1065 Square from, to, capsq;
1068 assert(move_is_ok(m));
1069 assert(move_is_ep(m));
1071 us = side_to_move();
1072 them = opposite_color(us);
1073 from = move_from(m);
1075 capsq = (us == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1077 assert(to == st->epSquare);
1078 assert(relative_rank(us, to) == RANK_6);
1079 assert(piece_on(to) == EMPTY);
1080 assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
1081 assert(piece_on(capsq) == piece_of_color_and_type(them, PAWN));
1083 // Remove captured pawn
1084 clear_bit(&(byColorBB[them]), capsq);
1085 clear_bit(&(byTypeBB[PAWN]), capsq);
1086 clear_bit(&(byTypeBB[0]), capsq); // HACK: byTypeBB[0] == occupied squares
1087 board[capsq] = EMPTY;
1089 // Move capturing pawn
1090 Bitboard move_bb = make_move_bb(from, to);
1091 do_move_bb(&(byColorBB[us]), move_bb);
1092 do_move_bb(&(byTypeBB[PAWN]), move_bb);
1093 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
1094 board[to] = board[from];
1095 board[from] = EMPTY;
1097 // Update material hash key
1098 st->materialKey ^= zobMaterial[them][PAWN][pieceCount[them][PAWN]];
1100 // Update piece count
1101 pieceCount[them][PAWN]--;
1103 // Update piece list
1104 pieceList[us][PAWN][index[from]] = to;
1105 index[to] = index[from];
1106 pieceList[them][PAWN][index[capsq]] = pieceList[them][PAWN][pieceCount[them][PAWN]];
1107 index[pieceList[them][PAWN][index[capsq]]] = index[capsq];
1110 st->key ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
1111 st->key ^= zobrist[them][PAWN][capsq];
1112 st->key ^= zobEp[st->epSquare];
1114 // Update pawn hash key
1115 st->pawnKey ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
1116 st->pawnKey ^= zobrist[them][PAWN][capsq];
1118 // Update incremental scores
1119 st->mgValue -= pst<MidGame>(them, PAWN, capsq);
1120 st->mgValue -= pst<MidGame>(us, PAWN, from);
1121 st->mgValue += pst<MidGame>(us, PAWN, to);
1122 st->egValue -= pst<EndGame>(them, PAWN, capsq);
1123 st->egValue -= pst<EndGame>(us, PAWN, from);
1124 st->egValue += pst<EndGame>(us, PAWN, to);
1126 // Reset en passant square
1127 st->epSquare = SQ_NONE;
1129 // Reset rule 50 counter
1132 // Update checkers BB
1133 st->checkersBB = attacks_to(king_square(them), us);
1137 /// Position::undo_move() unmakes a move. When it returns, the position should
1138 /// be restored to exactly the same state as before the move was made.
1140 void Position::undo_move(Move m) {
1143 assert(move_is_ok(m));
1146 sideToMove = opposite_color(sideToMove);
1148 if (move_is_castle(m))
1149 undo_castle_move(m);
1150 else if (move_promotion(m))
1151 undo_promotion_move(m);
1152 else if (move_is_ep(m))
1160 us = side_to_move();
1161 them = opposite_color(us);
1162 from = move_from(m);
1165 assert(piece_on(from) == EMPTY);
1166 assert(color_of_piece_on(to) == us);
1168 // Put the piece back at the source square
1169 Bitboard move_bb = make_move_bb(to, from);
1170 piece = type_of_piece_on(to);
1171 do_move_bb(&(byColorBB[us]), move_bb);
1172 do_move_bb(&(byTypeBB[piece]), move_bb);
1173 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
1174 board[from] = piece_of_color_and_type(us, piece);
1176 // If the moving piece was a king, update the king square
1178 kingSquare[us] = from;
1180 // Update piece list
1181 pieceList[us][piece][index[to]] = from;
1182 index[from] = index[to];
1186 assert(st->capture != KING);
1188 // Restore the captured piece
1189 set_bit(&(byColorBB[them]), to);
1190 set_bit(&(byTypeBB[st->capture]), to);
1191 set_bit(&(byTypeBB[0]), to);
1192 board[to] = piece_of_color_and_type(them, st->capture);
1194 // Update piece list
1195 pieceList[them][st->capture][pieceCount[them][st->capture]] = to;
1196 index[to] = pieceCount[them][st->capture];
1198 // Update piece count
1199 pieceCount[them][st->capture]++;
1204 // Finally point our state pointer back to the previous state
1211 /// Position::undo_castle_move() is a private method used to unmake a castling
1212 /// move. It is called from the main Position::undo_move function. Note that
1213 /// castling moves are encoded as "king captures friendly rook" moves, for
1214 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
1216 void Position::undo_castle_move(Move m) {
1218 assert(move_is_ok(m));
1219 assert(move_is_castle(m));
1221 // When we have arrived here, some work has already been done by
1222 // Position::undo_move. In particular, the side to move has been switched,
1223 // so the code below is correct.
1224 Color us = side_to_move();
1226 // Find source squares for king and rook
1227 Square kfrom = move_from(m);
1228 Square rfrom = move_to(m); // HACK: See comment at beginning of function
1231 // Find destination squares for king and rook
1232 if (rfrom > kfrom) // O-O
1234 kto = relative_square(us, SQ_G1);
1235 rto = relative_square(us, SQ_F1);
1237 kto = relative_square(us, SQ_C1);
1238 rto = relative_square(us, SQ_D1);
1241 assert(piece_on(kto) == piece_of_color_and_type(us, KING));
1242 assert(piece_on(rto) == piece_of_color_and_type(us, ROOK));
1244 // Remove pieces from destination squares
1245 clear_bit(&(byColorBB[us]), kto);
1246 clear_bit(&(byTypeBB[KING]), kto);
1247 clear_bit(&(byTypeBB[0]), kto); // HACK: byTypeBB[0] == occupied squares
1248 clear_bit(&(byColorBB[us]), rto);
1249 clear_bit(&(byTypeBB[ROOK]), rto);
1250 clear_bit(&(byTypeBB[0]), rto); // HACK: byTypeBB[0] == occupied squares
1252 // Put pieces on source squares
1253 set_bit(&(byColorBB[us]), kfrom);
1254 set_bit(&(byTypeBB[KING]), kfrom);
1255 set_bit(&(byTypeBB[0]), kfrom); // HACK: byTypeBB[0] == occupied squares
1256 set_bit(&(byColorBB[us]), rfrom);
1257 set_bit(&(byTypeBB[ROOK]), rfrom);
1258 set_bit(&(byTypeBB[0]), rfrom); // HACK: byTypeBB[0] == occupied squares
1261 board[rto] = board[kto] = EMPTY;
1262 board[rfrom] = piece_of_color_and_type(us, ROOK);
1263 board[kfrom] = piece_of_color_and_type(us, KING);
1265 // Update king square
1266 kingSquare[us] = kfrom;
1268 // Update piece lists
1269 pieceList[us][KING][index[kto]] = kfrom;
1270 pieceList[us][ROOK][index[rto]] = rfrom;
1271 int tmp = index[rto]; // Necessary because we may have rto == kfrom in FRC.
1272 index[kfrom] = index[kto];
1277 /// Position::undo_promotion_move() is a private method used to unmake a
1278 /// promotion move. It is called from the main Position::do_move
1281 void Position::undo_promotion_move(Move m) {
1285 PieceType promotion;
1287 assert(move_is_ok(m));
1288 assert(move_promotion(m));
1290 // When we have arrived here, some work has already been done by
1291 // Position::undo_move. In particular, the side to move has been switched,
1292 // so the code below is correct.
1293 us = side_to_move();
1294 them = opposite_color(us);
1295 from = move_from(m);
1298 assert(relative_rank(us, to) == RANK_8);
1299 assert(piece_on(from) == EMPTY);
1301 // Remove promoted piece
1302 promotion = move_promotion(m);
1303 assert(piece_on(to)==piece_of_color_and_type(us, promotion));
1304 assert(promotion >= KNIGHT && promotion <= QUEEN);
1305 clear_bit(&(byColorBB[us]), to);
1306 clear_bit(&(byTypeBB[promotion]), to);
1307 clear_bit(&(byTypeBB[0]), to); // HACK: byTypeBB[0] == occupied squares
1309 // Insert pawn at source square
1310 set_bit(&(byColorBB[us]), from);
1311 set_bit(&(byTypeBB[PAWN]), from);
1312 set_bit(&(byTypeBB[0]), from); // HACK: byTypeBB[0] == occupied squares
1313 board[from] = piece_of_color_and_type(us, PAWN);
1315 // Update piece list
1316 pieceList[us][PAWN][pieceCount[us][PAWN]] = from;
1317 index[from] = pieceCount[us][PAWN];
1318 pieceList[us][promotion][index[to]] =
1319 pieceList[us][promotion][pieceCount[us][promotion] - 1];
1320 index[pieceList[us][promotion][index[to]]] = index[to];
1322 // Update piece counts
1323 pieceCount[us][promotion]--;
1324 pieceCount[us][PAWN]++;
1328 assert(st->capture != KING);
1330 // Insert captured piece:
1331 set_bit(&(byColorBB[them]), to);
1332 set_bit(&(byTypeBB[st->capture]), to);
1333 set_bit(&(byTypeBB[0]), to); // HACK: byTypeBB[0] == occupied squares
1334 board[to] = piece_of_color_and_type(them, st->capture);
1336 // Update piece list
1337 pieceList[them][st->capture][pieceCount[them][st->capture]] = to;
1338 index[to] = pieceCount[them][st->capture];
1340 // Update piece count
1341 pieceCount[them][st->capture]++;
1347 /// Position::undo_ep_move() is a private method used to unmake an en passant
1348 /// capture. It is called from the main Position::undo_move function.
1350 void Position::undo_ep_move(Move m) {
1352 assert(move_is_ok(m));
1353 assert(move_is_ep(m));
1355 // When we have arrived here, some work has already been done by
1356 // Position::undo_move. In particular, the side to move has been switched,
1357 // so the code below is correct.
1358 Color us = side_to_move();
1359 Color them = opposite_color(us);
1360 Square from = move_from(m);
1361 Square to = move_to(m);
1362 Square capsq = (us == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1364 assert(to == st->previous->epSquare);
1365 assert(relative_rank(us, to) == RANK_6);
1366 assert(piece_on(to) == piece_of_color_and_type(us, PAWN));
1367 assert(piece_on(from) == EMPTY);
1368 assert(piece_on(capsq) == EMPTY);
1370 // Restore captured pawn
1371 set_bit(&(byColorBB[them]), capsq);
1372 set_bit(&(byTypeBB[PAWN]), capsq);
1373 set_bit(&(byTypeBB[0]), capsq);
1374 board[capsq] = piece_of_color_and_type(them, PAWN);
1376 // Move capturing pawn back to source square
1377 Bitboard move_bb = make_move_bb(to, from);
1378 do_move_bb(&(byColorBB[us]), move_bb);
1379 do_move_bb(&(byTypeBB[PAWN]), move_bb);
1380 do_move_bb(&(byTypeBB[0]), move_bb);
1382 board[from] = piece_of_color_and_type(us, PAWN);
1384 // Update piece list
1385 pieceList[us][PAWN][index[to]] = from;
1386 index[from] = index[to];
1387 pieceList[them][PAWN][pieceCount[them][PAWN]] = capsq;
1388 index[capsq] = pieceCount[them][PAWN];
1390 // Update piece count
1391 pieceCount[them][PAWN]++;
1395 /// Position::do_null_move makes() a "null move": It switches the side to move
1396 /// and updates the hash key without executing any move on the board.
1398 void Position::do_null_move(StateInfo& backupSt) {
1401 assert(!is_check());
1403 // Back up the information necessary to undo the null move to the supplied
1404 // StateInfo object.
1405 // Note that differently from normal case here backupSt is actually used as
1406 // a backup storage not as a new state to be used.
1407 backupSt.epSquare = st->epSquare;
1408 backupSt.key = st->key;
1409 backupSt.mgValue = st->mgValue;
1410 backupSt.egValue = st->egValue;
1411 backupSt.previous = st->previous;
1412 st->previous = &backupSt;
1414 // Save the current key to the history[] array, in order to be able to
1415 // detect repetition draws.
1416 history[gamePly] = st->key;
1418 // Update the necessary information
1419 sideToMove = opposite_color(sideToMove);
1420 if (st->epSquare != SQ_NONE)
1421 st->key ^= zobEp[st->epSquare];
1423 st->epSquare = SQ_NONE;
1426 st->key ^= zobSideToMove;
1428 st->mgValue += (sideToMove == WHITE)? TempoValueMidgame : -TempoValueMidgame;
1429 st->egValue += (sideToMove == WHITE)? TempoValueEndgame : -TempoValueEndgame;
1435 /// Position::undo_null_move() unmakes a "null move".
1437 void Position::undo_null_move() {
1440 assert(!is_check());
1442 // Restore information from the our backup StateInfo object
1443 st->epSquare = st->previous->epSquare;
1444 st->key = st->previous->key;
1445 st->mgValue = st->previous->mgValue;
1446 st->egValue = st->previous->egValue;
1447 st->previous = st->previous->previous;
1449 // Update the necessary information
1450 sideToMove = opposite_color(sideToMove);
1458 /// Position::see() is a static exchange evaluator: It tries to estimate the
1459 /// material gain or loss resulting from a move. There are three versions of
1460 /// this function: One which takes a destination square as input, one takes a
1461 /// move, and one which takes a 'from' and a 'to' square. The function does
1462 /// not yet understand promotions captures.
1464 int Position::see(Square to) const {
1466 assert(square_is_ok(to));
1467 return see(SQ_NONE, to);
1470 int Position::see(Move m) const {
1472 assert(move_is_ok(m));
1473 return see(move_from(m), move_to(m));
1476 int Position::see(Square from, Square to) const {
1479 static const int seeValues[18] = {
1480 0, PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
1481 RookValueMidgame, QueenValueMidgame, QueenValueMidgame*10, 0,
1482 0, PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
1483 RookValueMidgame, QueenValueMidgame, QueenValueMidgame*10, 0,
1487 Bitboard attackers, stmAttackers, occ, b;
1489 assert(square_is_ok(from) || from == SQ_NONE);
1490 assert(square_is_ok(to));
1492 // Initialize colors
1493 Color us = (from != SQ_NONE ? color_of_piece_on(from) : opposite_color(color_of_piece_on(to)));
1494 Color them = opposite_color(us);
1496 // Initialize pieces
1497 Piece piece = piece_on(from);
1498 Piece capture = piece_on(to);
1500 // Find all attackers to the destination square, with the moving piece
1501 // removed, but possibly an X-ray attacker added behind it.
1502 occ = occupied_squares();
1504 // Handle en passant moves
1505 if (st->epSquare == to && type_of_piece_on(from) == PAWN)
1507 assert(capture == EMPTY);
1509 Square capQq = (side_to_move() == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1510 capture = piece_on(capQq);
1511 assert(type_of_piece_on(capQq) == PAWN);
1513 // Remove the captured pawn
1514 clear_bit(&occ, capQq);
1519 clear_bit(&occ, from);
1520 attackers = (rook_attacks_bb(to, occ) & rooks_and_queens())
1521 | (bishop_attacks_bb(to, occ) & bishops_and_queens())
1522 | (piece_attacks<KNIGHT>(to) & knights())
1523 | (piece_attacks<KING>(to) & kings())
1524 | (pawn_attacks(WHITE, to) & pawns(BLACK))
1525 | (pawn_attacks(BLACK, to) & pawns(WHITE));
1527 if (from != SQ_NONE)
1530 // If we don't have any attacker we are finished
1531 if ((attackers & pieces_of_color(us)) == EmptyBoardBB)
1534 // Locate the least valuable attacker to the destination square
1535 // and use it to initialize from square.
1537 for (pt = PAWN; !(attackers & pieces_of_color_and_type(us, pt)); pt++)
1540 from = first_1(attackers & pieces_of_color_and_type(us, pt));
1541 piece = piece_on(from);
1544 // If the opponent has no attackers we are finished
1545 stmAttackers = attackers & pieces_of_color(them);
1547 return seeValues[capture];
1549 attackers &= occ; // Remove the moving piece
1551 // The destination square is defended, which makes things rather more
1552 // difficult to compute. We proceed by building up a "swap list" containing
1553 // the material gain or loss at each stop in a sequence of captures to the
1554 // destination square, where the sides alternately capture, and always
1555 // capture with the least valuable piece. After each capture, we look for
1556 // new X-ray attacks from behind the capturing piece.
1557 int lastCapturingPieceValue = seeValues[piece];
1558 int swapList[32], n = 1;
1562 swapList[0] = seeValues[capture];
1565 // Locate the least valuable attacker for the side to move. The loop
1566 // below looks like it is potentially infinite, but it isn't. We know
1567 // that the side to move still has at least one attacker left.
1568 for (pt = PAWN; !(stmAttackers & pieces_of_type(pt)); pt++)
1571 // Remove the attacker we just found from the 'attackers' bitboard,
1572 // and scan for new X-ray attacks behind the attacker.
1573 b = stmAttackers & pieces_of_type(pt);
1574 occ ^= (b & (~b + 1));
1575 attackers |= (rook_attacks_bb(to, occ) & rooks_and_queens())
1576 | (bishop_attacks_bb(to, occ) & bishops_and_queens());
1580 // Add the new entry to the swap list
1582 swapList[n] = -swapList[n - 1] + lastCapturingPieceValue;
1585 // Remember the value of the capturing piece, and change the side to move
1586 // before beginning the next iteration
1587 lastCapturingPieceValue = seeValues[pt];
1588 c = opposite_color(c);
1589 stmAttackers = attackers & pieces_of_color(c);
1591 // Stop after a king capture
1592 if (pt == KING && stmAttackers)
1595 swapList[n++] = 100;
1598 } while (stmAttackers);
1600 // Having built the swap list, we negamax through it to find the best
1601 // achievable score from the point of view of the side to move
1603 swapList[n-1] = Min(-swapList[n], swapList[n-1]);
1609 /// Position::setStartState() copies the content of the argument
1610 /// inside startState and makes st point to it. This is needed
1611 /// when the st pointee could become stale, as example because
1612 /// the caller is about to going out of scope.
1614 void Position::setStartState(const StateInfo& s) {
1621 /// Position::clear() erases the position object to a pristine state, with an
1622 /// empty board, white to move, and no castling rights.
1624 void Position::clear() {
1627 memset(st, 0, sizeof(StateInfo));
1628 st->epSquare = SQ_NONE;
1630 memset(index, 0, sizeof(int) * 64);
1631 memset(byColorBB, 0, sizeof(Bitboard) * 2);
1633 for (int i = 0; i < 64; i++)
1636 for (int i = 0; i < 7; i++)
1638 byTypeBB[i] = EmptyBoardBB;
1639 pieceCount[0][i] = pieceCount[1][i] = 0;
1640 for (int j = 0; j < 8; j++)
1641 pieceList[0][i][j] = pieceList[1][i][j] = SQ_NONE;
1646 initialKFile = FILE_E;
1647 initialKRFile = FILE_H;
1648 initialQRFile = FILE_A;
1652 /// Position::reset_game_ply() simply sets gamePly to 0. It is used from the
1653 /// UCI interface code, whenever a non-reversible move is made in a
1654 /// 'position fen <fen> moves m1 m2 ...' command. This makes it possible
1655 /// for the program to handle games of arbitrary length, as long as the GUI
1656 /// handles draws by the 50 move rule correctly.
1658 void Position::reset_game_ply() {
1664 /// Position::put_piece() puts a piece on the given square of the board,
1665 /// updating the board array, bitboards, and piece counts.
1667 void Position::put_piece(Piece p, Square s) {
1669 Color c = color_of_piece(p);
1670 PieceType pt = type_of_piece(p);
1673 index[s] = pieceCount[c][pt];
1674 pieceList[c][pt][index[s]] = s;
1676 set_bit(&(byTypeBB[pt]), s);
1677 set_bit(&(byColorBB[c]), s);
1678 set_bit(&byTypeBB[0], s); // HACK: byTypeBB[0] contains all occupied squares.
1680 pieceCount[c][pt]++;
1687 /// Position::allow_oo() gives the given side the right to castle kingside.
1688 /// Used when setting castling rights during parsing of FEN strings.
1690 void Position::allow_oo(Color c) {
1692 st->castleRights |= (1 + int(c));
1696 /// Position::allow_ooo() gives the given side the right to castle queenside.
1697 /// Used when setting castling rights during parsing of FEN strings.
1699 void Position::allow_ooo(Color c) {
1701 st->castleRights |= (4 + 4*int(c));
1705 /// Position::compute_key() computes the hash key of the position. The hash
1706 /// key is usually updated incrementally as moves are made and unmade, the
1707 /// compute_key() function is only used when a new position is set up, and
1708 /// to verify the correctness of the hash key when running in debug mode.
1710 Key Position::compute_key() const {
1712 Key result = Key(0ULL);
1714 for (Square s = SQ_A1; s <= SQ_H8; s++)
1715 if (square_is_occupied(s))
1716 result ^= zobrist[color_of_piece_on(s)][type_of_piece_on(s)][s];
1718 if (ep_square() != SQ_NONE)
1719 result ^= zobEp[ep_square()];
1721 result ^= zobCastle[st->castleRights];
1722 if (side_to_move() == BLACK)
1723 result ^= zobSideToMove;
1729 /// Position::compute_pawn_key() computes the hash key of the position. The
1730 /// hash key is usually updated incrementally as moves are made and unmade,
1731 /// the compute_pawn_key() function is only used when a new position is set
1732 /// up, and to verify the correctness of the pawn hash key when running in
1735 Key Position::compute_pawn_key() const {
1737 Key result = Key(0ULL);
1741 for (Color c = WHITE; c <= BLACK; c++)
1746 s = pop_1st_bit(&b);
1747 result ^= zobrist[c][PAWN][s];
1754 /// Position::compute_material_key() computes the hash key of the position.
1755 /// The hash key is usually updated incrementally as moves are made and unmade,
1756 /// the compute_material_key() function is only used when a new position is set
1757 /// up, and to verify the correctness of the material hash key when running in
1760 Key Position::compute_material_key() const {
1762 Key result = Key(0ULL);
1763 for (Color c = WHITE; c <= BLACK; c++)
1764 for (PieceType pt = PAWN; pt <= QUEEN; pt++)
1766 int count = piece_count(c, pt);
1767 for (int i = 0; i <= count; i++)
1768 result ^= zobMaterial[c][pt][i];
1774 /// Position::compute_value() compute the incremental scores for the middle
1775 /// game and the endgame. These functions are used to initialize the incremental
1776 /// scores when a new position is set up, and to verify that the scores are correctly
1777 /// updated by do_move and undo_move when the program is running in debug mode.
1778 template<Position::GamePhase Phase>
1779 Value Position::compute_value() const {
1781 Value result = Value(0);
1785 for (Color c = WHITE; c <= BLACK; c++)
1786 for (PieceType pt = PAWN; pt <= KING; pt++)
1788 b = pieces_of_color_and_type(c, pt);
1791 s = pop_1st_bit(&b);
1792 assert(piece_on(s) == piece_of_color_and_type(c, pt));
1793 result += pst<Phase>(c, pt, s);
1797 const Value TempoValue = (Phase == MidGame ? TempoValueMidgame : TempoValueEndgame);
1798 result += (side_to_move() == WHITE)? TempoValue / 2 : -TempoValue / 2;
1803 /// Position::compute_non_pawn_material() computes the total non-pawn middle
1804 /// game material score for the given side. Material scores are updated
1805 /// incrementally during the search, this function is only used while
1806 /// initializing a new Position object.
1808 Value Position::compute_non_pawn_material(Color c) const {
1810 Value result = Value(0);
1812 for (PieceType pt = KNIGHT; pt <= QUEEN; pt++)
1814 Bitboard b = pieces_of_color_and_type(c, pt);
1817 assert(piece_on(first_1(b)) == piece_of_color_and_type(c, pt));
1819 result += piece_value_midgame(pt);
1826 /// Position::is_draw() tests whether the position is drawn by material,
1827 /// repetition, or the 50 moves rule. It does not detect stalemates, this
1828 /// must be done by the search.
1830 bool Position::is_draw() const {
1832 // Draw by material?
1834 && (non_pawn_material(WHITE) + non_pawn_material(BLACK) <= BishopValueMidgame))
1837 // Draw by the 50 moves rule?
1838 if (st->rule50 > 100 || (st->rule50 == 100 && !is_check()))
1841 // Draw by repetition?
1842 for (int i = 2; i < Min(gamePly, st->rule50); i += 2)
1843 if (history[gamePly - i] == st->key)
1850 /// Position::is_mate() returns true or false depending on whether the
1851 /// side to move is checkmated.
1853 bool Position::is_mate() const {
1855 MoveStack moves[256];
1857 return is_check() && !generate_evasions(*this, moves, pinned_pieces(sideToMove));
1861 /// Position::has_mate_threat() tests whether a given color has a mate in one
1862 /// from the current position.
1864 bool Position::has_mate_threat(Color c) {
1867 Color stm = side_to_move();
1872 // If the input color is not equal to the side to move, do a null move
1876 MoveStack mlist[120];
1878 bool result = false;
1879 Bitboard dc = discovered_check_candidates(sideToMove);
1880 Bitboard pinned = pinned_pieces(sideToMove);
1882 // Generate pseudo-legal non-capture and capture check moves
1883 count = generate_non_capture_checks(*this, mlist, dc);
1884 count += generate_captures(*this, mlist + count);
1886 // Loop through the moves, and see if one of them is mate
1887 for (int i = 0; i < count; i++)
1889 Move move = mlist[i].move;
1891 if (!pl_move_is_legal(move, pinned))
1901 // Undo null move, if necessary
1909 /// Position::init_zobrist() is a static member function which initializes the
1910 /// various arrays used to compute hash keys.
1912 void Position::init_zobrist() {
1914 for (int i = 0; i < 2; i++)
1915 for (int j = 0; j < 8; j++)
1916 for (int k = 0; k < 64; k++)
1917 zobrist[i][j][k] = Key(genrand_int64());
1919 for (int i = 0; i < 64; i++)
1920 zobEp[i] = Key(genrand_int64());
1922 for (int i = 0; i < 16; i++)
1923 zobCastle[i] = genrand_int64();
1925 zobSideToMove = genrand_int64();
1927 for (int i = 0; i < 2; i++)
1928 for (int j = 0; j < 8; j++)
1929 for (int k = 0; k < 16; k++)
1930 zobMaterial[i][j][k] = (k > 0)? Key(genrand_int64()) : Key(0LL);
1932 for (int i = 0; i < 16; i++)
1933 zobMaterial[0][KING][i] = zobMaterial[1][KING][i] = Key(0ULL);
1937 /// Position::init_piece_square_tables() initializes the piece square tables.
1938 /// This is a two-step operation: First, the white halves of the tables are
1939 /// copied from the MgPST[][] and EgPST[][] arrays, with a small random number
1940 /// added to each entry if the "Randomness" UCI parameter is non-zero.
1941 /// Second, the black halves of the tables are initialized by mirroring
1942 /// and changing the sign of the corresponding white scores.
1944 void Position::init_piece_square_tables() {
1946 int r = get_option_value_int("Randomness"), i;
1947 for (Square s = SQ_A1; s <= SQ_H8; s++)
1948 for (Piece p = WP; p <= WK; p++)
1950 i = (r == 0)? 0 : (genrand_int32() % (r*2) - r);
1951 MgPieceSquareTable[p][s] = Value(MgPST[p][s] + i);
1952 EgPieceSquareTable[p][s] = Value(EgPST[p][s] + i);
1955 for (Square s = SQ_A1; s <= SQ_H8; s++)
1956 for (Piece p = BP; p <= BK; p++)
1958 MgPieceSquareTable[p][s] = -MgPieceSquareTable[p-8][flip_square(s)];
1959 EgPieceSquareTable[p][s] = -EgPieceSquareTable[p-8][flip_square(s)];
1964 /// Position::flipped_copy() makes a copy of the input position, but with
1965 /// the white and black sides reversed. This is only useful for debugging,
1966 /// especially for finding evaluation symmetry bugs.
1968 void Position::flipped_copy(const Position &pos) {
1970 assert(pos.is_ok());
1975 for (Square s = SQ_A1; s <= SQ_H8; s++)
1976 if (!pos.square_is_empty(s))
1977 put_piece(Piece(int(pos.piece_on(s)) ^ 8), flip_square(s));
1980 sideToMove = opposite_color(pos.side_to_move());
1983 if (pos.can_castle_kingside(WHITE)) allow_oo(BLACK);
1984 if (pos.can_castle_queenside(WHITE)) allow_ooo(BLACK);
1985 if (pos.can_castle_kingside(BLACK)) allow_oo(WHITE);
1986 if (pos.can_castle_queenside(BLACK)) allow_ooo(WHITE);
1988 initialKFile = pos.initialKFile;
1989 initialKRFile = pos.initialKRFile;
1990 initialQRFile = pos.initialQRFile;
1992 for (Square sq = SQ_A1; sq <= SQ_H8; sq++)
1993 castleRightsMask[sq] = ALL_CASTLES;
1995 castleRightsMask[make_square(initialKFile, RANK_1)] ^= (WHITE_OO | WHITE_OOO);
1996 castleRightsMask[make_square(initialKFile, RANK_8)] ^= (BLACK_OO | BLACK_OOO);
1997 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
1998 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
1999 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
2000 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
2002 // En passant square
2003 if (pos.st->epSquare != SQ_NONE)
2004 st->epSquare = flip_square(pos.st->epSquare);
2010 st->key = compute_key();
2011 st->pawnKey = compute_pawn_key();
2012 st->materialKey = compute_material_key();
2014 // Incremental scores
2015 st->mgValue = compute_value<MidGame>();
2016 st->egValue = compute_value<EndGame>();
2019 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
2020 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
2026 /// Position::is_ok() performs some consitency checks for the position object.
2027 /// This is meant to be helpful when debugging.
2029 bool Position::is_ok(int* failedStep) const {
2031 // What features of the position should be verified?
2032 static const bool debugBitboards = false;
2033 static const bool debugKingCount = false;
2034 static const bool debugKingCapture = false;
2035 static const bool debugCheckerCount = false;
2036 static const bool debugKey = false;
2037 static const bool debugMaterialKey = false;
2038 static const bool debugPawnKey = false;
2039 static const bool debugIncrementalEval = false;
2040 static const bool debugNonPawnMaterial = false;
2041 static const bool debugPieceCounts = false;
2042 static const bool debugPieceList = false;
2044 if (failedStep) *failedStep = 1;
2047 if (!color_is_ok(side_to_move()))
2050 // Are the king squares in the position correct?
2051 if (failedStep) (*failedStep)++;
2052 if (piece_on(king_square(WHITE)) != WK)
2055 if (failedStep) (*failedStep)++;
2056 if (piece_on(king_square(BLACK)) != BK)
2060 if (failedStep) (*failedStep)++;
2061 if (!file_is_ok(initialKRFile))
2064 if (!file_is_ok(initialQRFile))
2067 // Do both sides have exactly one king?
2068 if (failedStep) (*failedStep)++;
2071 int kingCount[2] = {0, 0};
2072 for (Square s = SQ_A1; s <= SQ_H8; s++)
2073 if (type_of_piece_on(s) == KING)
2074 kingCount[color_of_piece_on(s)]++;
2076 if (kingCount[0] != 1 || kingCount[1] != 1)
2080 // Can the side to move capture the opponent's king?
2081 if (failedStep) (*failedStep)++;
2082 if (debugKingCapture)
2084 Color us = side_to_move();
2085 Color them = opposite_color(us);
2086 Square ksq = king_square(them);
2087 if (square_is_attacked(ksq, us))
2091 // Is there more than 2 checkers?
2092 if (failedStep) (*failedStep)++;
2093 if (debugCheckerCount && count_1s(st->checkersBB) > 2)
2097 if (failedStep) (*failedStep)++;
2100 // The intersection of the white and black pieces must be empty
2101 if ((pieces_of_color(WHITE) & pieces_of_color(BLACK)) != EmptyBoardBB)
2104 // The union of the white and black pieces must be equal to all
2106 if ((pieces_of_color(WHITE) | pieces_of_color(BLACK)) != occupied_squares())
2109 // Separate piece type bitboards must have empty intersections
2110 for (PieceType p1 = PAWN; p1 <= KING; p1++)
2111 for (PieceType p2 = PAWN; p2 <= KING; p2++)
2112 if (p1 != p2 && (pieces_of_type(p1) & pieces_of_type(p2)))
2116 // En passant square OK?
2117 if (failedStep) (*failedStep)++;
2118 if (ep_square() != SQ_NONE)
2120 // The en passant square must be on rank 6, from the point of view of the
2122 if (relative_rank(side_to_move(), ep_square()) != RANK_6)
2127 if (failedStep) (*failedStep)++;
2128 if (debugKey && st->key != compute_key())
2131 // Pawn hash key OK?
2132 if (failedStep) (*failedStep)++;
2133 if (debugPawnKey && st->pawnKey != compute_pawn_key())
2136 // Material hash key OK?
2137 if (failedStep) (*failedStep)++;
2138 if (debugMaterialKey && st->materialKey != compute_material_key())
2141 // Incremental eval OK?
2142 if (failedStep) (*failedStep)++;
2143 if (debugIncrementalEval)
2145 if (st->mgValue != compute_value<MidGame>())
2148 if (st->egValue != compute_value<EndGame>())
2152 // Non-pawn material OK?
2153 if (failedStep) (*failedStep)++;
2154 if (debugNonPawnMaterial)
2156 if (st->npMaterial[WHITE] != compute_non_pawn_material(WHITE))
2159 if (st->npMaterial[BLACK] != compute_non_pawn_material(BLACK))
2164 if (failedStep) (*failedStep)++;
2165 if (debugPieceCounts)
2166 for (Color c = WHITE; c <= BLACK; c++)
2167 for (PieceType pt = PAWN; pt <= KING; pt++)
2168 if (pieceCount[c][pt] != count_1s(pieces_of_color_and_type(c, pt)))
2171 if (failedStep) (*failedStep)++;
2174 for(Color c = WHITE; c <= BLACK; c++)
2175 for(PieceType pt = PAWN; pt <= KING; pt++)
2176 for(int i = 0; i < pieceCount[c][pt]; i++)
2178 if (piece_on(piece_list(c, pt, i)) != piece_of_color_and_type(c, pt))
2181 if (index[piece_list(c, pt, i)] != i)
2185 if (failedStep) *failedStep = 0;