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/>.
37 #include "ucioption.h"
46 int Position::castleRightsMask[64];
48 Key Position::zobrist[2][8][64];
49 Key Position::zobEp[64];
50 Key Position::zobCastle[16];
51 Key Position::zobMaterial[2][8][16];
52 Key Position::zobSideToMove;
54 Value Position::MgPieceSquareTable[16][64];
55 Value Position::EgPieceSquareTable[16][64];
57 static bool RequestPending = false;
65 Position::Position(const Position& pos) {
69 Position::Position(const string& fen) {
74 /// Position::from_fen() initializes the position object with the given FEN
75 /// string. This function is not very robust - make sure that input FENs are
76 /// correct (this is assumed to be the responsibility of the GUI).
78 void Position::from_fen(const string& fen) {
80 static const string pieceLetters = "KQRBNPkqrbnp";
81 static const Piece pieces[] = { WK, WQ, WR, WB, WN, WP, BK, BQ, BR, BB, BN, BP };
89 for ( ; fen[i] != ' '; i++)
93 // Skip the given number of files
94 file += (fen[i] - '1' + 1);
97 else if (fen[i] == '/')
103 size_t idx = pieceLetters.find(fen[i]);
104 if (idx == string::npos)
106 std::cout << "Error in FEN at character " << i << std::endl;
109 Square square = make_square(file, rank);
110 put_piece(pieces[idx], square);
116 if (fen[i] != 'w' && fen[i] != 'b')
118 std::cout << "Error in FEN at character " << i << std::endl;
121 sideToMove = (fen[i] == 'w' ? WHITE : BLACK);
127 std::cout << "Error in FEN at character " << i << std::endl;
132 while(strchr("KQkqabcdefghABCDEFGH-", fen[i])) {
138 else if(fen[i] == 'K') allow_oo(WHITE);
139 else if(fen[i] == 'Q') allow_ooo(WHITE);
140 else if(fen[i] == 'k') allow_oo(BLACK);
141 else if(fen[i] == 'q') allow_ooo(BLACK);
142 else if(fen[i] >= 'A' && fen[i] <= 'H') {
143 File rookFile, kingFile = FILE_NONE;
144 for(Square square = SQ_B1; square <= SQ_G1; square++)
145 if(piece_on(square) == WK)
146 kingFile = square_file(square);
147 if(kingFile == FILE_NONE) {
148 std::cout << "Error in FEN at character " << i << std::endl;
151 initialKFile = kingFile;
152 rookFile = File(fen[i] - 'A') + FILE_A;
153 if(rookFile < initialKFile) {
155 initialQRFile = rookFile;
159 initialKRFile = rookFile;
162 else if(fen[i] >= 'a' && fen[i] <= 'h') {
163 File rookFile, kingFile = FILE_NONE;
164 for(Square square = SQ_B8; square <= SQ_G8; square++)
165 if(piece_on(square) == BK)
166 kingFile = square_file(square);
167 if(kingFile == FILE_NONE) {
168 std::cout << "Error in FEN at character " << i << std::endl;
171 initialKFile = kingFile;
172 rookFile = File(fen[i] - 'a') + FILE_A;
173 if(rookFile < initialKFile) {
175 initialQRFile = rookFile;
179 initialKRFile = rookFile;
183 std::cout << "Error in FEN at character " << i << std::endl;
190 while (fen[i] == ' ')
194 if ( i <= fen.length() - 2
195 && (fen[i] >= 'a' && fen[i] <= 'h')
196 && (fen[i+1] == '3' || fen[i+1] == '6'))
197 st->epSquare = square_from_string(fen.substr(i, 2));
199 // Various initialisation
200 for (Square sq = SQ_A1; sq <= SQ_H8; sq++)
201 castleRightsMask[sq] = ALL_CASTLES;
203 castleRightsMask[make_square(initialKFile, RANK_1)] ^= (WHITE_OO|WHITE_OOO);
204 castleRightsMask[make_square(initialKFile, RANK_8)] ^= (BLACK_OO|BLACK_OOO);
205 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
206 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
207 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
208 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
212 st->key = compute_key();
213 st->pawnKey = compute_pawn_key();
214 st->materialKey = compute_material_key();
215 st->mgValue = compute_value<MidGame>();
216 st->egValue = compute_value<EndGame>();
217 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
218 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
222 /// Position::to_fen() converts the position object to a FEN string. This is
223 /// probably only useful for debugging.
225 const string Position::to_fen() const {
227 static const string pieceLetters = " PNBRQK pnbrqk";
231 for (Rank rank = RANK_8; rank >= RANK_1; rank--)
234 for (File file = FILE_A; file <= FILE_H; file++)
236 Square sq = make_square(file, rank);
237 if (!square_is_occupied(sq))
243 fen += (char)skip + '0';
246 fen += pieceLetters[piece_on(sq)];
249 fen += (char)skip + '0';
251 fen += (rank > RANK_1 ? '/' : ' ');
253 fen += (sideToMove == WHITE ? "w " : "b ");
254 if (st->castleRights != NO_CASTLES)
256 if (can_castle_kingside(WHITE)) fen += 'K';
257 if (can_castle_queenside(WHITE)) fen += 'Q';
258 if (can_castle_kingside(BLACK)) fen += 'k';
259 if (can_castle_queenside(BLACK)) fen += 'q';
264 if (ep_square() != SQ_NONE)
265 fen += square_to_string(ep_square());
273 /// Position::print() prints an ASCII representation of the position to
274 /// the standard output. If a move is given then also the san is print.
276 void Position::print(Move m) const {
278 static const string pieceLetters = " PNBRQK PNBRQK .";
280 // Check for reentrancy, as example when called from inside
281 // MovePicker that is used also here in move_to_san()
285 RequestPending = true;
287 std::cout << std::endl;
290 string col = (color_of_piece_on(move_from(m)) == BLACK ? ".." : "");
291 std::cout << "Move is: " << col << move_to_san(*this, m) << std::endl;
293 for (Rank rank = RANK_8; rank >= RANK_1; rank--)
295 std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
296 for (File file = FILE_A; file <= FILE_H; file++)
298 Square sq = make_square(file, rank);
299 Piece piece = piece_on(sq);
300 if (piece == EMPTY && square_color(sq) == WHITE)
303 char col = (color_of_piece_on(sq) == BLACK ? '=' : ' ');
304 std::cout << '|' << col << pieceLetters[piece] << col;
306 std::cout << '|' << std::endl;
308 std::cout << "+---+---+---+---+---+---+---+---+" << std::endl
309 << "Fen is: " << to_fen() << std::endl
310 << "Key is: " << st->key << std::endl;
312 RequestPending = false;
316 /// Position::copy() creates a copy of the input position.
318 void Position::copy(const Position& pos) {
320 memcpy(this, &pos, sizeof(Position));
321 saveState(); // detach and copy state info
325 /// Position:hidden_checkers<>() returns a bitboard of all pinned (against the
326 /// king) pieces for the given color and for the given pinner type. Or, when
327 /// template parameter FindPinned is false, the pieces of the given color
328 /// candidate for a discovery check against the enemy king.
329 /// Note that checkersBB bitboard must be already updated.
331 template<bool FindPinned>
332 Bitboard Position::hidden_checkers(Color c) const {
334 Bitboard pinners, result = EmptyBoardBB;
336 // Pinned pieces protect our king, dicovery checks attack
338 Square ksq = king_square(FindPinned ? c : opposite_color(c));
340 // Pinners are sliders, not checkers, that give check when
341 // candidate pinned is removed.
342 pinners = (rooks_and_queens(FindPinned ? opposite_color(c) : c) & RookPseudoAttacks[ksq])
343 | (bishops_and_queens(FindPinned ? opposite_color(c) : c) & BishopPseudoAttacks[ksq]);
345 if (FindPinned && pinners)
346 pinners &= ~st->checkersBB;
350 Square s = pop_1st_bit(&pinners);
351 Bitboard b = squares_between(s, ksq) & occupied_squares();
355 if ( !(b & (b - 1)) // Only one bit set?
356 && (b & pieces_of_color(c))) // Is an our piece?
363 /// Position:pinned_pieces() returns a bitboard of all pinned (against the
364 /// king) pieces for the given color.
366 Bitboard Position::pinned_pieces(Color c) const {
368 return hidden_checkers<true>(c);
372 /// Position:discovered_check_candidates() returns a bitboard containing all
373 /// pieces for the given side which are candidates for giving a discovered
376 Bitboard Position::discovered_check_candidates(Color c) const {
378 return hidden_checkers<false>(c);
381 /// Position::attacks_to() computes a bitboard containing all pieces which
382 /// attacks a given square.
384 Bitboard Position::attacks_to(Square s) const {
386 return (pawn_attacks(BLACK, s) & pawns(WHITE))
387 | (pawn_attacks(WHITE, s) & pawns(BLACK))
388 | (piece_attacks<KNIGHT>(s) & pieces_of_type(KNIGHT))
389 | (piece_attacks<ROOK>(s) & rooks_and_queens())
390 | (piece_attacks<BISHOP>(s) & bishops_and_queens())
391 | (piece_attacks<KING>(s) & pieces_of_type(KING));
394 /// Position::piece_attacks_square() tests whether the piece on square f
395 /// attacks square t.
397 bool Position::piece_attacks_square(Piece p, Square f, Square t) const {
399 assert(square_is_ok(f));
400 assert(square_is_ok(t));
404 case WP: return pawn_attacks_square(WHITE, f, t);
405 case BP: return pawn_attacks_square(BLACK, f, t);
406 case WN: case BN: return piece_attacks_square<KNIGHT>(f, t);
407 case WB: case BB: return piece_attacks_square<BISHOP>(f, t);
408 case WR: case BR: return piece_attacks_square<ROOK>(f, t);
409 case WQ: case BQ: return piece_attacks_square<QUEEN>(f, t);
410 case WK: case BK: return piece_attacks_square<KING>(f, t);
417 /// Position::move_attacks_square() tests whether a move from the current
418 /// position attacks a given square.
420 bool Position::move_attacks_square(Move m, Square s) const {
422 assert(move_is_ok(m));
423 assert(square_is_ok(s));
425 Square f = move_from(m), t = move_to(m);
427 assert(square_is_occupied(f));
429 if (piece_attacks_square(piece_on(f), t, s))
432 // Move the piece and scan for X-ray attacks behind it
433 Bitboard occ = occupied_squares();
434 Color us = color_of_piece_on(f);
437 Bitboard xray = ( (rook_attacks_bb(s, occ) & rooks_and_queens())
438 |(bishop_attacks_bb(s, occ) & bishops_and_queens())) & pieces_of_color(us);
440 // If we have attacks we need to verify that are caused by our move
441 // and are not already existent ones.
442 return xray && (xray ^ (xray & piece_attacks<QUEEN>(s)));
446 /// Position::find_checkers() computes the checkersBB bitboard, which
447 /// contains a nonzero bit for each checking piece (0, 1 or 2). It
448 /// currently works by calling Position::attacks_to, which is probably
449 /// inefficient. Consider rewriting this function to use the last move
450 /// played, like in non-bitboard versions of Glaurung.
452 void Position::find_checkers() {
454 Color us = side_to_move();
455 st->checkersBB = attacks_to(king_square(us), opposite_color(us));
459 /// Position::pl_move_is_legal() tests whether a pseudo-legal move is legal
461 bool Position::pl_move_is_legal(Move m) const {
463 // If we're in check, all pseudo-legal moves are legal, because our
464 // check evasion generator only generates true legal moves.
465 return is_check() || pl_move_is_legal(m, pinned_pieces(side_to_move()));
468 bool Position::pl_move_is_legal(Move m, Bitboard pinned) const {
471 assert(move_is_ok(m));
472 assert(pinned == pinned_pieces(side_to_move()));
475 // Castling moves are checked for legality during move generation.
476 if (move_is_castle(m))
479 Color us = side_to_move();
480 Square from = move_from(m);
481 Square ksq = king_square(us);
483 assert(color_of_piece_on(from) == us);
484 assert(piece_on(ksq) == piece_of_color_and_type(us, KING));
486 // En passant captures are a tricky special case. Because they are
487 // rather uncommon, we do it simply by testing whether the king is attacked
488 // after the move is made
491 Color them = opposite_color(us);
492 Square to = move_to(m);
493 Square capsq = make_square(square_file(to), square_rank(from));
494 Bitboard b = occupied_squares();
496 assert(to == ep_square());
497 assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
498 assert(piece_on(capsq) == piece_of_color_and_type(them, PAWN));
499 assert(piece_on(to) == EMPTY);
502 clear_bit(&b, capsq);
505 return !(rook_attacks_bb(ksq, b) & rooks_and_queens(them))
506 && !(bishop_attacks_bb(ksq, b) & bishops_and_queens(them));
509 // If the moving piece is a king, check whether the destination
510 // square is attacked by the opponent.
512 return !(square_is_attacked(move_to(m), opposite_color(us)));
514 // A non-king move is legal if and only if it is not pinned or it
515 // is moving along the ray towards or away from the king.
517 || !bit_is_set(pinned, from)
518 || (direction_between_squares(from, ksq) == direction_between_squares(move_to(m), ksq)));
522 /// Position::move_is_check() tests whether a pseudo-legal move is a check
524 bool Position::move_is_check(Move m) const {
526 Bitboard dc = discovered_check_candidates(side_to_move());
527 return move_is_check(m, dc);
530 bool Position::move_is_check(Move m, Bitboard dcCandidates) const {
533 assert(move_is_ok(m));
534 assert(dcCandidates == discovered_check_candidates(side_to_move()));
536 Color us = side_to_move();
537 Color them = opposite_color(us);
538 Square from = move_from(m);
539 Square to = move_to(m);
540 Square ksq = king_square(them);
542 assert(color_of_piece_on(from) == us);
543 assert(piece_on(ksq) == piece_of_color_and_type(them, KING));
545 // Proceed according to the type of the moving piece
546 switch (type_of_piece_on(from))
550 if (bit_is_set(pawn_attacks(them, ksq), to)) // Normal check?
553 if ( dcCandidates // Discovered check?
554 && bit_is_set(dcCandidates, from)
555 && (direction_between_squares(from, ksq) != direction_between_squares(to, ksq)))
558 if (move_is_promotion(m)) // Promotion with check?
560 Bitboard b = occupied_squares();
563 switch (move_promotion_piece(m))
566 return bit_is_set(piece_attacks<KNIGHT>(to), ksq);
568 return bit_is_set(bishop_attacks_bb(to, b), ksq);
570 return bit_is_set(rook_attacks_bb(to, b), ksq);
572 return bit_is_set(queen_attacks_bb(to, b), ksq);
577 // En passant capture with check? We have already handled the case
578 // of direct checks and ordinary discovered check, the only case we
579 // need to handle is the unusual case of a discovered check through the
581 else if (move_is_ep(m))
583 Square capsq = make_square(square_file(to), square_rank(from));
584 Bitboard b = occupied_squares();
586 clear_bit(&b, capsq);
588 return (rook_attacks_bb(ksq, b) & rooks_and_queens(us))
589 ||(bishop_attacks_bb(ksq, b) & bishops_and_queens(us));
593 // Test discovered check and normal check according to piece type
595 return (dcCandidates && bit_is_set(dcCandidates, from))
596 || bit_is_set(piece_attacks<KNIGHT>(ksq), to);
599 return (dcCandidates && bit_is_set(dcCandidates, from))
600 || (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to));
603 return (dcCandidates && bit_is_set(dcCandidates, from))
604 || (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to));
607 // Discovered checks are impossible!
608 assert(!bit_is_set(dcCandidates, from));
609 return ( (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to))
610 || (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to)));
614 if ( bit_is_set(dcCandidates, from)
615 && (direction_between_squares(from, ksq) != direction_between_squares(to, ksq)))
618 // Castling with check?
619 if (move_is_castle(m))
621 Square kfrom, kto, rfrom, rto;
622 Bitboard b = occupied_squares();
628 kto = relative_square(us, SQ_G1);
629 rto = relative_square(us, SQ_F1);
631 kto = relative_square(us, SQ_C1);
632 rto = relative_square(us, SQ_D1);
634 clear_bit(&b, kfrom);
635 clear_bit(&b, rfrom);
638 return bit_is_set(rook_attacks_bb(rto, b), ksq);
642 default: // NO_PIECE_TYPE
650 /// Position::update_checkers() udpates chekers info given the move. It is called
651 /// in do_move() and is faster then find_checkers().
653 template<PieceType Piece>
654 inline void Position::update_checkers(Bitboard* pCheckersBB, Square ksq, Square from,
655 Square to, Bitboard dcCandidates) {
657 const bool Bishop = (Piece == QUEEN || Piece == BISHOP);
658 const bool Rook = (Piece == QUEEN || Piece == ROOK);
659 const bool Slider = Bishop || Rook;
662 if ( ( (Bishop && bit_is_set(BishopPseudoAttacks[ksq], to))
663 || (Rook && bit_is_set(RookPseudoAttacks[ksq], to)))
664 && bit_is_set(piece_attacks<Piece>(ksq), to)) // slow, try to early skip
665 set_bit(pCheckersBB, to);
667 else if ( Piece != KING
669 && bit_is_set(piece_attacks<Piece>(ksq), to))
670 set_bit(pCheckersBB, to);
673 if (Piece != QUEEN && bit_is_set(dcCandidates, from))
676 (*pCheckersBB) |= (piece_attacks<ROOK>(ksq) & rooks_and_queens(side_to_move()));
679 (*pCheckersBB) |= (piece_attacks<BISHOP>(ksq) & bishops_and_queens(side_to_move()));
684 /// Position::do_move() makes a move, and saves all information necessary
685 /// to a StateInfo object. The move is assumed to be legal.
686 /// Pseudo-legal moves should be filtered out before this function is called.
688 void Position::do_move(Move m, StateInfo& newSt) {
690 do_move(m, newSt, discovered_check_candidates(side_to_move()));
693 void Position::do_move(Move m, StateInfo& newSt, Bitboard dcCandidates) {
696 assert(move_is_ok(m));
698 // Copy some fields of old state to our new StateInfo object except the
699 // ones which are recalculated from scratch anyway, then switch our state
700 // pointer to point to the new, ready to be updated, state.
701 struct ReducedStateInfo {
702 Key key, pawnKey, materialKey;
703 int castleRights, rule50;
705 Value mgValue, egValue;
709 memcpy(&newSt, st, sizeof(ReducedStateInfo));
710 newSt.capture = NO_PIECE_TYPE;
714 // Save the current key to the history[] array, in order to be able to
715 // detect repetition draws.
716 history[gamePly] = st->key;
718 // Increment the 50 moves rule draw counter. Resetting it to zero in the
719 // case of non-reversible moves is taken care of later.
722 if (move_is_castle(m))
724 else if (move_is_promotion(m))
725 do_promotion_move(m);
726 else if (move_is_ep(m))
730 Color us = side_to_move();
731 Color them = opposite_color(us);
732 Square from = move_from(m);
733 Square to = move_to(m);
735 assert(color_of_piece_on(from) == us);
736 assert(color_of_piece_on(to) == them || piece_on(to) == EMPTY);
738 PieceType piece = type_of_piece_on(from);
740 st->capture = type_of_piece_on(to);
743 do_capture_move(st->capture, them, to);
746 Bitboard move_bb = make_move_bb(from, to);
747 do_move_bb(&(byColorBB[us]), move_bb);
748 do_move_bb(&(byTypeBB[piece]), move_bb);
749 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
751 board[to] = board[from];
755 st->key ^= zobrist[us][piece][from] ^ zobrist[us][piece][to];
757 // Update incremental scores
758 st->mgValue -= pst<MidGame>(us, piece, from);
759 st->mgValue += pst<MidGame>(us, piece, to);
760 st->egValue -= pst<EndGame>(us, piece, from);
761 st->egValue += pst<EndGame>(us, piece, to);
763 // If the moving piece was a king, update the king square
767 // Reset en passant square
768 if (st->epSquare != SQ_NONE)
770 st->key ^= zobEp[st->epSquare];
771 st->epSquare = SQ_NONE;
774 // If the moving piece was a pawn do some special extra work
777 // Reset rule 50 draw counter
780 // Update pawn hash key
781 st->pawnKey ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
783 // Set en passant square, only if moved pawn can be captured
784 if (abs(int(to) - int(from)) == 16)
786 if ( (us == WHITE && (pawn_attacks(WHITE, from + DELTA_N) & pawns(BLACK)))
787 || (us == BLACK && (pawn_attacks(BLACK, from + DELTA_S) & pawns(WHITE))))
789 st->epSquare = Square((int(from) + int(to)) / 2);
790 st->key ^= zobEp[st->epSquare];
795 // Update piece lists
796 pieceList[us][piece][index[from]] = to;
797 index[to] = index[from];
799 // Update castle rights, try to shortcut a common case
800 if ((castleRightsMask[from] & castleRightsMask[to]) != ALL_CASTLES)
802 st->key ^= zobCastle[st->castleRights];
803 st->castleRights &= castleRightsMask[from];
804 st->castleRights &= castleRightsMask[to];
805 st->key ^= zobCastle[st->castleRights];
808 // Update checkers bitboard, piece must be already moved
809 st->checkersBB = EmptyBoardBB;
810 Square ksq = king_square(them);
813 case PAWN: update_checkers<PAWN>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
814 case KNIGHT: update_checkers<KNIGHT>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
815 case BISHOP: update_checkers<BISHOP>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
816 case ROOK: update_checkers<ROOK>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
817 case QUEEN: update_checkers<QUEEN>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
818 case KING: update_checkers<KING>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
819 default: assert(false); break;
824 st->key ^= zobSideToMove;
825 sideToMove = opposite_color(sideToMove);
828 st->mgValue += (sideToMove == WHITE)? TempoValueMidgame : -TempoValueMidgame;
829 st->egValue += (sideToMove == WHITE)? TempoValueEndgame : -TempoValueEndgame;
835 /// Position::do_capture_move() is a private method used to update captured
836 /// piece info. It is called from the main Position::do_move function.
838 void Position::do_capture_move(PieceType capture, Color them, Square to) {
840 assert(capture != KING);
842 // Remove captured piece
843 clear_bit(&(byColorBB[them]), to);
844 clear_bit(&(byTypeBB[capture]), to);
845 clear_bit(&(byTypeBB[0]), to);
848 st->key ^= zobrist[them][capture][to];
850 // If the captured piece was a pawn, update pawn hash key
852 st->pawnKey ^= zobrist[them][PAWN][to];
854 // Update incremental scores
855 st->mgValue -= pst<MidGame>(them, capture, to);
856 st->egValue -= pst<EndGame>(them, capture, to);
860 st->npMaterial[them] -= piece_value_midgame(capture);
862 // Update material hash key
863 st->materialKey ^= zobMaterial[them][capture][pieceCount[them][capture]];
865 // Update piece count
866 pieceCount[them][capture]--;
869 pieceList[them][capture][index[to]] = pieceList[them][capture][pieceCount[them][capture]];
870 index[pieceList[them][capture][index[to]]] = index[to];
872 // Reset rule 50 counter
877 /// Position::do_castle_move() is a private method used to make a castling
878 /// move. It is called from the main Position::do_move function. Note that
879 /// castling moves are encoded as "king captures friendly rook" moves, for
880 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
882 void Position::do_castle_move(Move m) {
885 assert(move_is_ok(m));
886 assert(move_is_castle(m));
888 Color us = side_to_move();
889 Color them = opposite_color(us);
891 // Find source squares for king and rook
892 Square kfrom = move_from(m);
893 Square rfrom = move_to(m); // HACK: See comment at beginning of function
896 assert(piece_on(kfrom) == piece_of_color_and_type(us, KING));
897 assert(piece_on(rfrom) == piece_of_color_and_type(us, ROOK));
899 // Find destination squares for king and rook
900 if (rfrom > kfrom) // O-O
902 kto = relative_square(us, SQ_G1);
903 rto = relative_square(us, SQ_F1);
905 kto = relative_square(us, SQ_C1);
906 rto = relative_square(us, SQ_D1);
909 // Remove pieces from source squares
910 clear_bit(&(byColorBB[us]), kfrom);
911 clear_bit(&(byTypeBB[KING]), kfrom);
912 clear_bit(&(byTypeBB[0]), kfrom); // HACK: byTypeBB[0] == occupied squares
913 clear_bit(&(byColorBB[us]), rfrom);
914 clear_bit(&(byTypeBB[ROOK]), rfrom);
915 clear_bit(&(byTypeBB[0]), rfrom); // HACK: byTypeBB[0] == occupied squares
917 // Put pieces on destination squares
918 set_bit(&(byColorBB[us]), kto);
919 set_bit(&(byTypeBB[KING]), kto);
920 set_bit(&(byTypeBB[0]), kto); // HACK: byTypeBB[0] == occupied squares
921 set_bit(&(byColorBB[us]), rto);
922 set_bit(&(byTypeBB[ROOK]), rto);
923 set_bit(&(byTypeBB[0]), rto); // HACK: byTypeBB[0] == occupied squares
925 // Update board array
926 board[kfrom] = board[rfrom] = EMPTY;
927 board[kto] = piece_of_color_and_type(us, KING);
928 board[rto] = piece_of_color_and_type(us, ROOK);
930 // Update king square
931 kingSquare[us] = kto;
933 // Update piece lists
934 pieceList[us][KING][index[kfrom]] = kto;
935 pieceList[us][ROOK][index[rfrom]] = rto;
936 int tmp = index[rfrom];
937 index[kto] = index[kfrom];
940 // Update incremental scores
941 st->mgValue -= pst<MidGame>(us, KING, kfrom);
942 st->mgValue += pst<MidGame>(us, KING, kto);
943 st->egValue -= pst<EndGame>(us, KING, kfrom);
944 st->egValue += pst<EndGame>(us, KING, kto);
945 st->mgValue -= pst<MidGame>(us, ROOK, rfrom);
946 st->mgValue += pst<MidGame>(us, ROOK, rto);
947 st->egValue -= pst<EndGame>(us, ROOK, rfrom);
948 st->egValue += pst<EndGame>(us, ROOK, rto);
951 st->key ^= zobrist[us][KING][kfrom] ^ zobrist[us][KING][kto];
952 st->key ^= zobrist[us][ROOK][rfrom] ^ zobrist[us][ROOK][rto];
954 // Clear en passant square
955 if (st->epSquare != SQ_NONE)
957 st->key ^= zobEp[st->epSquare];
958 st->epSquare = SQ_NONE;
961 // Update castling rights
962 st->key ^= zobCastle[st->castleRights];
963 st->castleRights &= castleRightsMask[kfrom];
964 st->key ^= zobCastle[st->castleRights];
966 // Reset rule 50 counter
969 // Update checkers BB
970 st->checkersBB = attacks_to(king_square(them), us);
974 /// Position::do_promotion_move() is a private method used to make a promotion
975 /// move. It is called from the main Position::do_move function.
977 void Position::do_promotion_move(Move m) {
984 assert(move_is_ok(m));
985 assert(move_is_promotion(m));
988 them = opposite_color(us);
992 assert(relative_rank(us, to) == RANK_8);
993 assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
994 assert(color_of_piece_on(to) == them || square_is_empty(to));
996 st->capture = type_of_piece_on(to);
999 do_capture_move(st->capture, them, to);
1002 clear_bit(&(byColorBB[us]), from);
1003 clear_bit(&(byTypeBB[PAWN]), from);
1004 clear_bit(&(byTypeBB[0]), from); // HACK: byTypeBB[0] == occupied squares
1005 board[from] = EMPTY;
1007 // Insert promoted piece
1008 promotion = move_promotion_piece(m);
1009 assert(promotion >= KNIGHT && promotion <= QUEEN);
1010 set_bit(&(byColorBB[us]), to);
1011 set_bit(&(byTypeBB[promotion]), to);
1012 set_bit(&(byTypeBB[0]), to); // HACK: byTypeBB[0] == occupied squares
1013 board[to] = piece_of_color_and_type(us, promotion);
1016 st->key ^= zobrist[us][PAWN][from] ^ zobrist[us][promotion][to];
1018 // Update pawn hash key
1019 st->pawnKey ^= zobrist[us][PAWN][from];
1021 // Update material key
1022 st->materialKey ^= zobMaterial[us][PAWN][pieceCount[us][PAWN]];
1023 st->materialKey ^= zobMaterial[us][promotion][pieceCount[us][promotion]+1];
1025 // Update piece counts
1026 pieceCount[us][PAWN]--;
1027 pieceCount[us][promotion]++;
1029 // Update piece lists
1030 pieceList[us][PAWN][index[from]] = pieceList[us][PAWN][pieceCount[us][PAWN]];
1031 index[pieceList[us][PAWN][index[from]]] = index[from];
1032 pieceList[us][promotion][pieceCount[us][promotion] - 1] = to;
1033 index[to] = pieceCount[us][promotion] - 1;
1035 // Update incremental scores
1036 st->mgValue -= pst<MidGame>(us, PAWN, from);
1037 st->mgValue += pst<MidGame>(us, promotion, to);
1038 st->egValue -= pst<EndGame>(us, PAWN, from);
1039 st->egValue += pst<EndGame>(us, promotion, to);
1042 st->npMaterial[us] += piece_value_midgame(promotion);
1044 // Clear the en passant square
1045 if (st->epSquare != SQ_NONE)
1047 st->key ^= zobEp[st->epSquare];
1048 st->epSquare = SQ_NONE;
1051 // Update castle rights
1052 st->key ^= zobCastle[st->castleRights];
1053 st->castleRights &= castleRightsMask[to];
1054 st->key ^= zobCastle[st->castleRights];
1056 // Reset rule 50 counter
1059 // Update checkers BB
1060 st->checkersBB = attacks_to(king_square(them), us);
1064 /// Position::do_ep_move() is a private method used to make an en passant
1065 /// capture. It is called from the main Position::do_move function.
1067 void Position::do_ep_move(Move m) {
1070 Square from, to, capsq;
1073 assert(move_is_ok(m));
1074 assert(move_is_ep(m));
1076 us = side_to_move();
1077 them = opposite_color(us);
1078 from = move_from(m);
1080 capsq = (us == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1082 assert(to == st->epSquare);
1083 assert(relative_rank(us, to) == RANK_6);
1084 assert(piece_on(to) == EMPTY);
1085 assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
1086 assert(piece_on(capsq) == piece_of_color_and_type(them, PAWN));
1088 // Remove captured pawn
1089 clear_bit(&(byColorBB[them]), capsq);
1090 clear_bit(&(byTypeBB[PAWN]), capsq);
1091 clear_bit(&(byTypeBB[0]), capsq); // HACK: byTypeBB[0] == occupied squares
1092 board[capsq] = EMPTY;
1094 // Move capturing pawn
1095 Bitboard move_bb = make_move_bb(from, to);
1096 do_move_bb(&(byColorBB[us]), move_bb);
1097 do_move_bb(&(byTypeBB[PAWN]), move_bb);
1098 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
1099 board[to] = board[from];
1100 board[from] = EMPTY;
1102 // Update material hash key
1103 st->materialKey ^= zobMaterial[them][PAWN][pieceCount[them][PAWN]];
1105 // Update piece count
1106 pieceCount[them][PAWN]--;
1108 // Update piece list
1109 pieceList[us][PAWN][index[from]] = to;
1110 index[to] = index[from];
1111 pieceList[them][PAWN][index[capsq]] = pieceList[them][PAWN][pieceCount[them][PAWN]];
1112 index[pieceList[them][PAWN][index[capsq]]] = index[capsq];
1115 st->key ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
1116 st->key ^= zobrist[them][PAWN][capsq];
1117 st->key ^= zobEp[st->epSquare];
1119 // Update pawn hash key
1120 st->pawnKey ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
1121 st->pawnKey ^= zobrist[them][PAWN][capsq];
1123 // Update incremental scores
1124 st->mgValue -= pst<MidGame>(them, PAWN, capsq);
1125 st->mgValue -= pst<MidGame>(us, PAWN, from);
1126 st->mgValue += pst<MidGame>(us, PAWN, to);
1127 st->egValue -= pst<EndGame>(them, PAWN, capsq);
1128 st->egValue -= pst<EndGame>(us, PAWN, from);
1129 st->egValue += pst<EndGame>(us, PAWN, to);
1131 // Reset en passant square
1132 st->epSquare = SQ_NONE;
1134 // Reset rule 50 counter
1137 // Update checkers BB
1138 st->checkersBB = attacks_to(king_square(them), us);
1142 /// Position::undo_move() unmakes a move. When it returns, the position should
1143 /// be restored to exactly the same state as before the move was made.
1145 void Position::undo_move(Move m) {
1148 assert(move_is_ok(m));
1151 sideToMove = opposite_color(sideToMove);
1153 if (move_is_castle(m))
1154 undo_castle_move(m);
1155 else if (move_is_promotion(m))
1156 undo_promotion_move(m);
1157 else if (move_is_ep(m))
1165 us = side_to_move();
1166 them = opposite_color(us);
1167 from = move_from(m);
1170 assert(piece_on(from) == EMPTY);
1171 assert(color_of_piece_on(to) == us);
1173 // Put the piece back at the source square
1174 Bitboard move_bb = make_move_bb(to, from);
1175 piece = type_of_piece_on(to);
1176 do_move_bb(&(byColorBB[us]), move_bb);
1177 do_move_bb(&(byTypeBB[piece]), move_bb);
1178 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
1179 board[from] = piece_of_color_and_type(us, piece);
1181 // If the moving piece was a king, update the king square
1183 kingSquare[us] = from;
1185 // Update piece list
1186 pieceList[us][piece][index[to]] = from;
1187 index[from] = index[to];
1191 assert(st->capture != KING);
1193 // Restore the captured piece
1194 set_bit(&(byColorBB[them]), to);
1195 set_bit(&(byTypeBB[st->capture]), to);
1196 set_bit(&(byTypeBB[0]), to);
1197 board[to] = piece_of_color_and_type(them, st->capture);
1199 // Update piece list
1200 pieceList[them][st->capture][pieceCount[them][st->capture]] = to;
1201 index[to] = pieceCount[them][st->capture];
1203 // Update piece count
1204 pieceCount[them][st->capture]++;
1209 // Finally point our state pointer back to the previous state
1216 /// Position::undo_castle_move() is a private method used to unmake a castling
1217 /// move. It is called from the main Position::undo_move function. Note that
1218 /// castling moves are encoded as "king captures friendly rook" moves, for
1219 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
1221 void Position::undo_castle_move(Move m) {
1223 assert(move_is_ok(m));
1224 assert(move_is_castle(m));
1226 // When we have arrived here, some work has already been done by
1227 // Position::undo_move. In particular, the side to move has been switched,
1228 // so the code below is correct.
1229 Color us = side_to_move();
1231 // Find source squares for king and rook
1232 Square kfrom = move_from(m);
1233 Square rfrom = move_to(m); // HACK: See comment at beginning of function
1236 // Find destination squares for king and rook
1237 if (rfrom > kfrom) // O-O
1239 kto = relative_square(us, SQ_G1);
1240 rto = relative_square(us, SQ_F1);
1242 kto = relative_square(us, SQ_C1);
1243 rto = relative_square(us, SQ_D1);
1246 assert(piece_on(kto) == piece_of_color_and_type(us, KING));
1247 assert(piece_on(rto) == piece_of_color_and_type(us, ROOK));
1249 // Remove pieces from destination squares
1250 clear_bit(&(byColorBB[us]), kto);
1251 clear_bit(&(byTypeBB[KING]), kto);
1252 clear_bit(&(byTypeBB[0]), kto); // HACK: byTypeBB[0] == occupied squares
1253 clear_bit(&(byColorBB[us]), rto);
1254 clear_bit(&(byTypeBB[ROOK]), rto);
1255 clear_bit(&(byTypeBB[0]), rto); // HACK: byTypeBB[0] == occupied squares
1257 // Put pieces on source squares
1258 set_bit(&(byColorBB[us]), kfrom);
1259 set_bit(&(byTypeBB[KING]), kfrom);
1260 set_bit(&(byTypeBB[0]), kfrom); // HACK: byTypeBB[0] == occupied squares
1261 set_bit(&(byColorBB[us]), rfrom);
1262 set_bit(&(byTypeBB[ROOK]), rfrom);
1263 set_bit(&(byTypeBB[0]), rfrom); // HACK: byTypeBB[0] == occupied squares
1266 board[rto] = board[kto] = EMPTY;
1267 board[rfrom] = piece_of_color_and_type(us, ROOK);
1268 board[kfrom] = piece_of_color_and_type(us, KING);
1270 // Update king square
1271 kingSquare[us] = kfrom;
1273 // Update piece lists
1274 pieceList[us][KING][index[kto]] = kfrom;
1275 pieceList[us][ROOK][index[rto]] = rfrom;
1276 int tmp = index[rto]; // Necessary because we may have rto == kfrom in FRC.
1277 index[kfrom] = index[kto];
1282 /// Position::undo_promotion_move() is a private method used to unmake a
1283 /// promotion move. It is called from the main Position::do_move
1286 void Position::undo_promotion_move(Move m) {
1290 PieceType promotion;
1292 assert(move_is_ok(m));
1293 assert(move_is_promotion(m));
1295 // When we have arrived here, some work has already been done by
1296 // Position::undo_move. In particular, the side to move has been switched,
1297 // so the code below is correct.
1298 us = side_to_move();
1299 them = opposite_color(us);
1300 from = move_from(m);
1303 assert(relative_rank(us, to) == RANK_8);
1304 assert(piece_on(from) == EMPTY);
1306 // Remove promoted piece
1307 promotion = move_promotion_piece(m);
1308 assert(piece_on(to)==piece_of_color_and_type(us, promotion));
1309 assert(promotion >= KNIGHT && promotion <= QUEEN);
1310 clear_bit(&(byColorBB[us]), to);
1311 clear_bit(&(byTypeBB[promotion]), to);
1312 clear_bit(&(byTypeBB[0]), to); // HACK: byTypeBB[0] == occupied squares
1314 // Insert pawn at source square
1315 set_bit(&(byColorBB[us]), from);
1316 set_bit(&(byTypeBB[PAWN]), from);
1317 set_bit(&(byTypeBB[0]), from); // HACK: byTypeBB[0] == occupied squares
1318 board[from] = piece_of_color_and_type(us, PAWN);
1320 // Update piece list
1321 pieceList[us][PAWN][pieceCount[us][PAWN]] = from;
1322 index[from] = pieceCount[us][PAWN];
1323 pieceList[us][promotion][index[to]] =
1324 pieceList[us][promotion][pieceCount[us][promotion] - 1];
1325 index[pieceList[us][promotion][index[to]]] = index[to];
1327 // Update piece counts
1328 pieceCount[us][promotion]--;
1329 pieceCount[us][PAWN]++;
1333 assert(st->capture != KING);
1335 // Insert captured piece:
1336 set_bit(&(byColorBB[them]), to);
1337 set_bit(&(byTypeBB[st->capture]), to);
1338 set_bit(&(byTypeBB[0]), to); // HACK: byTypeBB[0] == occupied squares
1339 board[to] = piece_of_color_and_type(them, st->capture);
1341 // Update piece list
1342 pieceList[them][st->capture][pieceCount[them][st->capture]] = to;
1343 index[to] = pieceCount[them][st->capture];
1345 // Update piece count
1346 pieceCount[them][st->capture]++;
1352 /// Position::undo_ep_move() is a private method used to unmake an en passant
1353 /// capture. It is called from the main Position::undo_move function.
1355 void Position::undo_ep_move(Move m) {
1357 assert(move_is_ok(m));
1358 assert(move_is_ep(m));
1360 // When we have arrived here, some work has already been done by
1361 // Position::undo_move. In particular, the side to move has been switched,
1362 // so the code below is correct.
1363 Color us = side_to_move();
1364 Color them = opposite_color(us);
1365 Square from = move_from(m);
1366 Square to = move_to(m);
1367 Square capsq = (us == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1369 assert(to == st->previous->epSquare);
1370 assert(relative_rank(us, to) == RANK_6);
1371 assert(piece_on(to) == piece_of_color_and_type(us, PAWN));
1372 assert(piece_on(from) == EMPTY);
1373 assert(piece_on(capsq) == EMPTY);
1375 // Restore captured pawn
1376 set_bit(&(byColorBB[them]), capsq);
1377 set_bit(&(byTypeBB[PAWN]), capsq);
1378 set_bit(&(byTypeBB[0]), capsq);
1379 board[capsq] = piece_of_color_and_type(them, PAWN);
1381 // Move capturing pawn back to source square
1382 Bitboard move_bb = make_move_bb(to, from);
1383 do_move_bb(&(byColorBB[us]), move_bb);
1384 do_move_bb(&(byTypeBB[PAWN]), move_bb);
1385 do_move_bb(&(byTypeBB[0]), move_bb);
1387 board[from] = piece_of_color_and_type(us, PAWN);
1389 // Update piece list
1390 pieceList[us][PAWN][index[to]] = from;
1391 index[from] = index[to];
1392 pieceList[them][PAWN][pieceCount[them][PAWN]] = capsq;
1393 index[capsq] = pieceCount[them][PAWN];
1395 // Update piece count
1396 pieceCount[them][PAWN]++;
1400 /// Position::do_null_move makes() a "null move": It switches the side to move
1401 /// and updates the hash key without executing any move on the board.
1403 void Position::do_null_move(StateInfo& backupSt) {
1406 assert(!is_check());
1408 // Back up the information necessary to undo the null move to the supplied
1409 // StateInfo object.
1410 // Note that differently from normal case here backupSt is actually used as
1411 // a backup storage not as a new state to be used.
1412 backupSt.epSquare = st->epSquare;
1413 backupSt.key = st->key;
1414 backupSt.mgValue = st->mgValue;
1415 backupSt.egValue = st->egValue;
1416 backupSt.previous = st->previous;
1417 st->previous = &backupSt;
1419 // Save the current key to the history[] array, in order to be able to
1420 // detect repetition draws.
1421 history[gamePly] = st->key;
1423 // Update the necessary information
1424 sideToMove = opposite_color(sideToMove);
1425 if (st->epSquare != SQ_NONE)
1426 st->key ^= zobEp[st->epSquare];
1428 st->epSquare = SQ_NONE;
1431 st->key ^= zobSideToMove;
1433 st->mgValue += (sideToMove == WHITE)? TempoValueMidgame : -TempoValueMidgame;
1434 st->egValue += (sideToMove == WHITE)? TempoValueEndgame : -TempoValueEndgame;
1440 /// Position::undo_null_move() unmakes a "null move".
1442 void Position::undo_null_move() {
1445 assert(!is_check());
1447 // Restore information from the our backup StateInfo object
1448 st->epSquare = st->previous->epSquare;
1449 st->key = st->previous->key;
1450 st->mgValue = st->previous->mgValue;
1451 st->egValue = st->previous->egValue;
1452 st->previous = st->previous->previous;
1454 // Update the necessary information
1455 sideToMove = opposite_color(sideToMove);
1463 /// Position::see() is a static exchange evaluator: It tries to estimate the
1464 /// material gain or loss resulting from a move. There are three versions of
1465 /// this function: One which takes a destination square as input, one takes a
1466 /// move, and one which takes a 'from' and a 'to' square. The function does
1467 /// not yet understand promotions captures.
1469 int Position::see(Square to) const {
1471 assert(square_is_ok(to));
1472 return see(SQ_NONE, to);
1475 int Position::see(Move m) const {
1477 assert(move_is_ok(m));
1478 return see(move_from(m), move_to(m));
1481 int Position::see(Square from, Square to) const {
1484 static const int seeValues[18] = {
1485 0, PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
1486 RookValueMidgame, QueenValueMidgame, QueenValueMidgame*10, 0,
1487 0, PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
1488 RookValueMidgame, QueenValueMidgame, QueenValueMidgame*10, 0,
1492 Bitboard attackers, stmAttackers, occ, b;
1494 assert(square_is_ok(from) || from == SQ_NONE);
1495 assert(square_is_ok(to));
1497 // Initialize colors
1498 Color us = (from != SQ_NONE ? color_of_piece_on(from) : opposite_color(color_of_piece_on(to)));
1499 Color them = opposite_color(us);
1501 // Initialize pieces
1502 Piece piece = piece_on(from);
1503 Piece capture = piece_on(to);
1505 // Find all attackers to the destination square, with the moving piece
1506 // removed, but possibly an X-ray attacker added behind it.
1507 occ = occupied_squares();
1509 // Handle en passant moves
1510 if (st->epSquare == to && type_of_piece_on(from) == PAWN)
1512 assert(capture == EMPTY);
1514 Square capQq = (side_to_move() == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1515 capture = piece_on(capQq);
1516 assert(type_of_piece_on(capQq) == PAWN);
1518 // Remove the captured pawn
1519 clear_bit(&occ, capQq);
1524 clear_bit(&occ, from);
1525 attackers = (rook_attacks_bb(to, occ) & rooks_and_queens())
1526 | (bishop_attacks_bb(to, occ) & bishops_and_queens())
1527 | (piece_attacks<KNIGHT>(to) & knights())
1528 | (piece_attacks<KING>(to) & kings())
1529 | (pawn_attacks(WHITE, to) & pawns(BLACK))
1530 | (pawn_attacks(BLACK, to) & pawns(WHITE));
1532 if (from != SQ_NONE)
1535 // If we don't have any attacker we are finished
1536 if ((attackers & pieces_of_color(us)) == EmptyBoardBB)
1539 // Locate the least valuable attacker to the destination square
1540 // and use it to initialize from square.
1542 for (pt = PAWN; !(attackers & pieces_of_color_and_type(us, pt)); pt++)
1545 from = first_1(attackers & pieces_of_color_and_type(us, pt));
1546 piece = piece_on(from);
1549 // If the opponent has no attackers we are finished
1550 stmAttackers = attackers & pieces_of_color(them);
1552 return seeValues[capture];
1554 attackers &= occ; // Remove the moving piece
1556 // The destination square is defended, which makes things rather more
1557 // difficult to compute. We proceed by building up a "swap list" containing
1558 // the material gain or loss at each stop in a sequence of captures to the
1559 // destination square, where the sides alternately capture, and always
1560 // capture with the least valuable piece. After each capture, we look for
1561 // new X-ray attacks from behind the capturing piece.
1562 int lastCapturingPieceValue = seeValues[piece];
1563 int swapList[32], n = 1;
1567 swapList[0] = seeValues[capture];
1570 // Locate the least valuable attacker for the side to move. The loop
1571 // below looks like it is potentially infinite, but it isn't. We know
1572 // that the side to move still has at least one attacker left.
1573 for (pt = PAWN; !(stmAttackers & pieces_of_type(pt)); pt++)
1576 // Remove the attacker we just found from the 'attackers' bitboard,
1577 // and scan for new X-ray attacks behind the attacker.
1578 b = stmAttackers & pieces_of_type(pt);
1579 occ ^= (b & (~b + 1));
1580 attackers |= (rook_attacks_bb(to, occ) & rooks_and_queens())
1581 | (bishop_attacks_bb(to, occ) & bishops_and_queens());
1585 // Add the new entry to the swap list
1587 swapList[n] = -swapList[n - 1] + lastCapturingPieceValue;
1590 // Remember the value of the capturing piece, and change the side to move
1591 // before beginning the next iteration
1592 lastCapturingPieceValue = seeValues[pt];
1593 c = opposite_color(c);
1594 stmAttackers = attackers & pieces_of_color(c);
1596 // Stop after a king capture
1597 if (pt == KING && stmAttackers)
1600 swapList[n++] = QueenValueMidgame*10;
1603 } while (stmAttackers);
1605 // Having built the swap list, we negamax through it to find the best
1606 // achievable score from the point of view of the side to move
1608 swapList[n-1] = Min(-swapList[n], swapList[n-1]);
1614 /// Position::saveState() copies the content of the current state
1615 /// inside startState and makes st point to it. This is needed
1616 /// when the st pointee could become stale, as example because
1617 /// the caller is about to going out of scope.
1619 void Position::saveState() {
1623 st->previous = NULL; // as a safe guard
1627 /// Position::clear() erases the position object to a pristine state, with an
1628 /// empty board, white to move, and no castling rights.
1630 void Position::clear() {
1633 memset(st, 0, sizeof(StateInfo));
1634 st->epSquare = SQ_NONE;
1636 memset(index, 0, sizeof(int) * 64);
1637 memset(byColorBB, 0, sizeof(Bitboard) * 2);
1639 for (int i = 0; i < 64; i++)
1642 for (int i = 0; i < 7; i++)
1644 byTypeBB[i] = EmptyBoardBB;
1645 pieceCount[0][i] = pieceCount[1][i] = 0;
1646 for (int j = 0; j < 8; j++)
1647 pieceList[0][i][j] = pieceList[1][i][j] = SQ_NONE;
1652 initialKFile = FILE_E;
1653 initialKRFile = FILE_H;
1654 initialQRFile = FILE_A;
1658 /// Position::reset_game_ply() simply sets gamePly to 0. It is used from the
1659 /// UCI interface code, whenever a non-reversible move is made in a
1660 /// 'position fen <fen> moves m1 m2 ...' command. This makes it possible
1661 /// for the program to handle games of arbitrary length, as long as the GUI
1662 /// handles draws by the 50 move rule correctly.
1664 void Position::reset_game_ply() {
1670 /// Position::put_piece() puts a piece on the given square of the board,
1671 /// updating the board array, bitboards, and piece counts.
1673 void Position::put_piece(Piece p, Square s) {
1675 Color c = color_of_piece(p);
1676 PieceType pt = type_of_piece(p);
1679 index[s] = pieceCount[c][pt];
1680 pieceList[c][pt][index[s]] = s;
1682 set_bit(&(byTypeBB[pt]), s);
1683 set_bit(&(byColorBB[c]), s);
1684 set_bit(&byTypeBB[0], s); // HACK: byTypeBB[0] contains all occupied squares.
1686 pieceCount[c][pt]++;
1693 /// Position::allow_oo() gives the given side the right to castle kingside.
1694 /// Used when setting castling rights during parsing of FEN strings.
1696 void Position::allow_oo(Color c) {
1698 st->castleRights |= (1 + int(c));
1702 /// Position::allow_ooo() gives the given side the right to castle queenside.
1703 /// Used when setting castling rights during parsing of FEN strings.
1705 void Position::allow_ooo(Color c) {
1707 st->castleRights |= (4 + 4*int(c));
1711 /// Position::compute_key() computes the hash key of the position. The hash
1712 /// key is usually updated incrementally as moves are made and unmade, the
1713 /// compute_key() function is only used when a new position is set up, and
1714 /// to verify the correctness of the hash key when running in debug mode.
1716 Key Position::compute_key() const {
1718 Key result = Key(0ULL);
1720 for (Square s = SQ_A1; s <= SQ_H8; s++)
1721 if (square_is_occupied(s))
1722 result ^= zobrist[color_of_piece_on(s)][type_of_piece_on(s)][s];
1724 if (ep_square() != SQ_NONE)
1725 result ^= zobEp[ep_square()];
1727 result ^= zobCastle[st->castleRights];
1728 if (side_to_move() == BLACK)
1729 result ^= zobSideToMove;
1735 /// Position::compute_pawn_key() computes the hash key of the position. The
1736 /// hash key is usually updated incrementally as moves are made and unmade,
1737 /// the compute_pawn_key() function is only used when a new position is set
1738 /// up, and to verify the correctness of the pawn hash key when running in
1741 Key Position::compute_pawn_key() const {
1743 Key result = Key(0ULL);
1747 for (Color c = WHITE; c <= BLACK; c++)
1752 s = pop_1st_bit(&b);
1753 result ^= zobrist[c][PAWN][s];
1760 /// Position::compute_material_key() computes the hash key of the position.
1761 /// The hash key is usually updated incrementally as moves are made and unmade,
1762 /// the compute_material_key() function is only used when a new position is set
1763 /// up, and to verify the correctness of the material hash key when running in
1766 Key Position::compute_material_key() const {
1768 Key result = Key(0ULL);
1769 for (Color c = WHITE; c <= BLACK; c++)
1770 for (PieceType pt = PAWN; pt <= QUEEN; pt++)
1772 int count = piece_count(c, pt);
1773 for (int i = 0; i <= count; i++)
1774 result ^= zobMaterial[c][pt][i];
1780 /// Position::compute_value() compute the incremental scores for the middle
1781 /// game and the endgame. These functions are used to initialize the incremental
1782 /// scores when a new position is set up, and to verify that the scores are correctly
1783 /// updated by do_move and undo_move when the program is running in debug mode.
1784 template<Position::GamePhase Phase>
1785 Value Position::compute_value() const {
1787 Value result = Value(0);
1791 for (Color c = WHITE; c <= BLACK; c++)
1792 for (PieceType pt = PAWN; pt <= KING; pt++)
1794 b = pieces_of_color_and_type(c, pt);
1797 s = pop_1st_bit(&b);
1798 assert(piece_on(s) == piece_of_color_and_type(c, pt));
1799 result += pst<Phase>(c, pt, s);
1803 const Value TempoValue = (Phase == MidGame ? TempoValueMidgame : TempoValueEndgame);
1804 result += (side_to_move() == WHITE)? TempoValue / 2 : -TempoValue / 2;
1809 /// Position::compute_non_pawn_material() computes the total non-pawn middle
1810 /// game material score for the given side. Material scores are updated
1811 /// incrementally during the search, this function is only used while
1812 /// initializing a new Position object.
1814 Value Position::compute_non_pawn_material(Color c) const {
1816 Value result = Value(0);
1818 for (PieceType pt = KNIGHT; pt <= QUEEN; pt++)
1820 Bitboard b = pieces_of_color_and_type(c, pt);
1823 assert(piece_on(first_1(b)) == piece_of_color_and_type(c, pt));
1825 result += piece_value_midgame(pt);
1832 /// Position::is_draw() tests whether the position is drawn by material,
1833 /// repetition, or the 50 moves rule. It does not detect stalemates, this
1834 /// must be done by the search.
1836 bool Position::is_draw() const {
1838 // Draw by material?
1840 && (non_pawn_material(WHITE) + non_pawn_material(BLACK) <= BishopValueMidgame))
1843 // Draw by the 50 moves rule?
1844 if (st->rule50 > 100 || (st->rule50 == 100 && !is_check()))
1847 // Draw by repetition?
1848 for (int i = 2; i < Min(gamePly, st->rule50); i += 2)
1849 if (history[gamePly - i] == st->key)
1856 /// Position::is_mate() returns true or false depending on whether the
1857 /// side to move is checkmated.
1859 bool Position::is_mate() const {
1861 MoveStack moves[256];
1863 return is_check() && !generate_evasions(*this, moves, pinned_pieces(sideToMove));
1867 /// Position::has_mate_threat() tests whether a given color has a mate in one
1868 /// from the current position.
1870 bool Position::has_mate_threat(Color c) {
1873 Color stm = side_to_move();
1878 // If the input color is not equal to the side to move, do a null move
1882 MoveStack mlist[120];
1884 bool result = false;
1885 Bitboard dc = discovered_check_candidates(sideToMove);
1886 Bitboard pinned = pinned_pieces(sideToMove);
1888 // Generate pseudo-legal non-capture and capture check moves
1889 count = generate_non_capture_checks(*this, mlist, dc);
1890 count += generate_captures(*this, mlist + count);
1892 // Loop through the moves, and see if one of them is mate
1893 for (int i = 0; i < count; i++)
1895 Move move = mlist[i].move;
1897 if (!pl_move_is_legal(move, pinned))
1907 // Undo null move, if necessary
1915 /// Position::init_zobrist() is a static member function which initializes the
1916 /// various arrays used to compute hash keys.
1918 void Position::init_zobrist() {
1920 for (int i = 0; i < 2; i++)
1921 for (int j = 0; j < 8; j++)
1922 for (int k = 0; k < 64; k++)
1923 zobrist[i][j][k] = Key(genrand_int64());
1925 for (int i = 0; i < 64; i++)
1926 zobEp[i] = Key(genrand_int64());
1928 for (int i = 0; i < 16; i++)
1929 zobCastle[i] = genrand_int64();
1931 zobSideToMove = genrand_int64();
1933 for (int i = 0; i < 2; i++)
1934 for (int j = 0; j < 8; j++)
1935 for (int k = 0; k < 16; k++)
1936 zobMaterial[i][j][k] = (k > 0)? Key(genrand_int64()) : Key(0LL);
1938 for (int i = 0; i < 16; i++)
1939 zobMaterial[0][KING][i] = zobMaterial[1][KING][i] = Key(0ULL);
1943 /// Position::init_piece_square_tables() initializes the piece square tables.
1944 /// This is a two-step operation: First, the white halves of the tables are
1945 /// copied from the MgPST[][] and EgPST[][] arrays, with a small random number
1946 /// added to each entry if the "Randomness" UCI parameter is non-zero.
1947 /// Second, the black halves of the tables are initialized by mirroring
1948 /// and changing the sign of the corresponding white scores.
1950 void Position::init_piece_square_tables() {
1952 int r = get_option_value_int("Randomness"), i;
1953 for (Square s = SQ_A1; s <= SQ_H8; s++)
1954 for (Piece p = WP; p <= WK; p++)
1956 i = (r == 0)? 0 : (genrand_int32() % (r*2) - r);
1957 MgPieceSquareTable[p][s] = Value(MgPST[p][s] + i);
1958 EgPieceSquareTable[p][s] = Value(EgPST[p][s] + i);
1961 for (Square s = SQ_A1; s <= SQ_H8; s++)
1962 for (Piece p = BP; p <= BK; p++)
1964 MgPieceSquareTable[p][s] = -MgPieceSquareTable[p-8][flip_square(s)];
1965 EgPieceSquareTable[p][s] = -EgPieceSquareTable[p-8][flip_square(s)];
1970 /// Position::flipped_copy() makes a copy of the input position, but with
1971 /// the white and black sides reversed. This is only useful for debugging,
1972 /// especially for finding evaluation symmetry bugs.
1974 void Position::flipped_copy(const Position& pos) {
1976 assert(pos.is_ok());
1981 for (Square s = SQ_A1; s <= SQ_H8; s++)
1982 if (!pos.square_is_empty(s))
1983 put_piece(Piece(int(pos.piece_on(s)) ^ 8), flip_square(s));
1986 sideToMove = opposite_color(pos.side_to_move());
1989 if (pos.can_castle_kingside(WHITE)) allow_oo(BLACK);
1990 if (pos.can_castle_queenside(WHITE)) allow_ooo(BLACK);
1991 if (pos.can_castle_kingside(BLACK)) allow_oo(WHITE);
1992 if (pos.can_castle_queenside(BLACK)) allow_ooo(WHITE);
1994 initialKFile = pos.initialKFile;
1995 initialKRFile = pos.initialKRFile;
1996 initialQRFile = pos.initialQRFile;
1998 for (Square sq = SQ_A1; sq <= SQ_H8; sq++)
1999 castleRightsMask[sq] = ALL_CASTLES;
2001 castleRightsMask[make_square(initialKFile, RANK_1)] ^= (WHITE_OO | WHITE_OOO);
2002 castleRightsMask[make_square(initialKFile, RANK_8)] ^= (BLACK_OO | BLACK_OOO);
2003 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
2004 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
2005 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
2006 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
2008 // En passant square
2009 if (pos.st->epSquare != SQ_NONE)
2010 st->epSquare = flip_square(pos.st->epSquare);
2016 st->key = compute_key();
2017 st->pawnKey = compute_pawn_key();
2018 st->materialKey = compute_material_key();
2020 // Incremental scores
2021 st->mgValue = compute_value<MidGame>();
2022 st->egValue = compute_value<EndGame>();
2025 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
2026 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
2032 /// Position::is_ok() performs some consitency checks for the position object.
2033 /// This is meant to be helpful when debugging.
2035 bool Position::is_ok(int* failedStep) const {
2037 // What features of the position should be verified?
2038 static const bool debugBitboards = false;
2039 static const bool debugKingCount = false;
2040 static const bool debugKingCapture = false;
2041 static const bool debugCheckerCount = false;
2042 static const bool debugKey = false;
2043 static const bool debugMaterialKey = false;
2044 static const bool debugPawnKey = false;
2045 static const bool debugIncrementalEval = false;
2046 static const bool debugNonPawnMaterial = false;
2047 static const bool debugPieceCounts = false;
2048 static const bool debugPieceList = false;
2050 if (failedStep) *failedStep = 1;
2053 if (!color_is_ok(side_to_move()))
2056 // Are the king squares in the position correct?
2057 if (failedStep) (*failedStep)++;
2058 if (piece_on(king_square(WHITE)) != WK)
2061 if (failedStep) (*failedStep)++;
2062 if (piece_on(king_square(BLACK)) != BK)
2066 if (failedStep) (*failedStep)++;
2067 if (!file_is_ok(initialKRFile))
2070 if (!file_is_ok(initialQRFile))
2073 // Do both sides have exactly one king?
2074 if (failedStep) (*failedStep)++;
2077 int kingCount[2] = {0, 0};
2078 for (Square s = SQ_A1; s <= SQ_H8; s++)
2079 if (type_of_piece_on(s) == KING)
2080 kingCount[color_of_piece_on(s)]++;
2082 if (kingCount[0] != 1 || kingCount[1] != 1)
2086 // Can the side to move capture the opponent's king?
2087 if (failedStep) (*failedStep)++;
2088 if (debugKingCapture)
2090 Color us = side_to_move();
2091 Color them = opposite_color(us);
2092 Square ksq = king_square(them);
2093 if (square_is_attacked(ksq, us))
2097 // Is there more than 2 checkers?
2098 if (failedStep) (*failedStep)++;
2099 if (debugCheckerCount && count_1s(st->checkersBB) > 2)
2103 if (failedStep) (*failedStep)++;
2106 // The intersection of the white and black pieces must be empty
2107 if ((pieces_of_color(WHITE) & pieces_of_color(BLACK)) != EmptyBoardBB)
2110 // The union of the white and black pieces must be equal to all
2112 if ((pieces_of_color(WHITE) | pieces_of_color(BLACK)) != occupied_squares())
2115 // Separate piece type bitboards must have empty intersections
2116 for (PieceType p1 = PAWN; p1 <= KING; p1++)
2117 for (PieceType p2 = PAWN; p2 <= KING; p2++)
2118 if (p1 != p2 && (pieces_of_type(p1) & pieces_of_type(p2)))
2122 // En passant square OK?
2123 if (failedStep) (*failedStep)++;
2124 if (ep_square() != SQ_NONE)
2126 // The en passant square must be on rank 6, from the point of view of the
2128 if (relative_rank(side_to_move(), ep_square()) != RANK_6)
2133 if (failedStep) (*failedStep)++;
2134 if (debugKey && st->key != compute_key())
2137 // Pawn hash key OK?
2138 if (failedStep) (*failedStep)++;
2139 if (debugPawnKey && st->pawnKey != compute_pawn_key())
2142 // Material hash key OK?
2143 if (failedStep) (*failedStep)++;
2144 if (debugMaterialKey && st->materialKey != compute_material_key())
2147 // Incremental eval OK?
2148 if (failedStep) (*failedStep)++;
2149 if (debugIncrementalEval)
2151 if (st->mgValue != compute_value<MidGame>())
2154 if (st->egValue != compute_value<EndGame>())
2158 // Non-pawn material OK?
2159 if (failedStep) (*failedStep)++;
2160 if (debugNonPawnMaterial)
2162 if (st->npMaterial[WHITE] != compute_non_pawn_material(WHITE))
2165 if (st->npMaterial[BLACK] != compute_non_pawn_material(BLACK))
2170 if (failedStep) (*failedStep)++;
2171 if (debugPieceCounts)
2172 for (Color c = WHITE; c <= BLACK; c++)
2173 for (PieceType pt = PAWN; pt <= KING; pt++)
2174 if (pieceCount[c][pt] != count_1s(pieces_of_color_and_type(c, pt)))
2177 if (failedStep) (*failedStep)++;
2180 for(Color c = WHITE; c <= BLACK; c++)
2181 for(PieceType pt = PAWN; pt <= KING; pt++)
2182 for(int i = 0; i < pieceCount[c][pt]; i++)
2184 if (piece_on(piece_list(c, pt, i)) != piece_of_color_and_type(c, pt))
2187 if (index[piece_list(c, pt, i)] != i)
2191 if (failedStep) *failedStep = 0;