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/>.
38 #include "ucioption.h"
47 int Position::castleRightsMask[64];
49 Key Position::zobrist[2][8][64];
50 Key Position::zobEp[64];
51 Key Position::zobCastle[16];
52 Key Position::zobMaterial[2][8][16];
53 Key Position::zobSideToMove;
55 Value Position::MgPieceSquareTable[16][64];
56 Value Position::EgPieceSquareTable[16][64];
58 static bool RequestPending = false;
66 Position::Position(const Position& pos) {
70 Position::Position(const string& fen) {
75 /// Position::from_fen() initializes the position object with the given FEN
76 /// string. This function is not very robust - make sure that input FENs are
77 /// correct (this is assumed to be the responsibility of the GUI).
79 void Position::from_fen(const string& fen) {
81 static const string pieceLetters = "KQRBNPkqrbnp";
82 static const Piece pieces[] = { WK, WQ, WR, WB, WN, WP, BK, BQ, BR, BB, BN, BP };
90 for ( ; fen[i] != ' '; i++)
94 // Skip the given number of files
95 file += (fen[i] - '1' + 1);
98 else if (fen[i] == '/')
104 size_t idx = pieceLetters.find(fen[i]);
105 if (idx == string::npos)
107 std::cout << "Error in FEN at character " << i << std::endl;
110 Square square = make_square(file, rank);
111 put_piece(pieces[idx], square);
117 if (fen[i] != 'w' && fen[i] != 'b')
119 std::cout << "Error in FEN at character " << i << std::endl;
122 sideToMove = (fen[i] == 'w' ? WHITE : BLACK);
128 std::cout << "Error in FEN at character " << i << std::endl;
133 while(strchr("KQkqabcdefghABCDEFGH-", fen[i])) {
139 else if(fen[i] == 'K') allow_oo(WHITE);
140 else if(fen[i] == 'Q') allow_ooo(WHITE);
141 else if(fen[i] == 'k') allow_oo(BLACK);
142 else if(fen[i] == 'q') allow_ooo(BLACK);
143 else if(fen[i] >= 'A' && fen[i] <= 'H') {
144 File rookFile, kingFile = FILE_NONE;
145 for(Square square = SQ_B1; square <= SQ_G1; square++)
146 if(piece_on(square) == WK)
147 kingFile = square_file(square);
148 if(kingFile == FILE_NONE) {
149 std::cout << "Error in FEN at character " << i << std::endl;
152 initialKFile = kingFile;
153 rookFile = File(fen[i] - 'A') + FILE_A;
154 if(rookFile < initialKFile) {
156 initialQRFile = rookFile;
160 initialKRFile = rookFile;
163 else if(fen[i] >= 'a' && fen[i] <= 'h') {
164 File rookFile, kingFile = FILE_NONE;
165 for(Square square = SQ_B8; square <= SQ_G8; square++)
166 if(piece_on(square) == BK)
167 kingFile = square_file(square);
168 if(kingFile == FILE_NONE) {
169 std::cout << "Error in FEN at character " << i << std::endl;
172 initialKFile = kingFile;
173 rookFile = File(fen[i] - 'a') + FILE_A;
174 if(rookFile < initialKFile) {
176 initialQRFile = rookFile;
180 initialKRFile = rookFile;
184 std::cout << "Error in FEN at character " << i << std::endl;
191 while (fen[i] == ' ')
195 if ( i <= fen.length() - 2
196 && (fen[i] >= 'a' && fen[i] <= 'h')
197 && (fen[i+1] == '3' || fen[i+1] == '6'))
198 st->epSquare = square_from_string(fen.substr(i, 2));
200 // Various initialisation
201 for (Square sq = SQ_A1; sq <= SQ_H8; sq++)
202 castleRightsMask[sq] = ALL_CASTLES;
204 castleRightsMask[make_square(initialKFile, RANK_1)] ^= (WHITE_OO|WHITE_OOO);
205 castleRightsMask[make_square(initialKFile, RANK_8)] ^= (BLACK_OO|BLACK_OOO);
206 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
207 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
208 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
209 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
213 st->key = compute_key();
214 st->pawnKey = compute_pawn_key();
215 st->materialKey = compute_material_key();
216 st->mgValue = compute_value<MidGame>();
217 st->egValue = compute_value<EndGame>();
218 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
219 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
223 /// Position::to_fen() converts the position object to a FEN string. This is
224 /// probably only useful for debugging.
226 const string Position::to_fen() const {
228 static const string pieceLetters = " PNBRQK pnbrqk";
232 for (Rank rank = RANK_8; rank >= RANK_1; rank--)
235 for (File file = FILE_A; file <= FILE_H; file++)
237 Square sq = make_square(file, rank);
238 if (!square_is_occupied(sq))
244 fen += (char)skip + '0';
247 fen += pieceLetters[piece_on(sq)];
250 fen += (char)skip + '0';
252 fen += (rank > RANK_1 ? '/' : ' ');
254 fen += (sideToMove == WHITE ? "w " : "b ");
255 if (st->castleRights != NO_CASTLES)
257 if (can_castle_kingside(WHITE)) fen += 'K';
258 if (can_castle_queenside(WHITE)) fen += 'Q';
259 if (can_castle_kingside(BLACK)) fen += 'k';
260 if (can_castle_queenside(BLACK)) fen += 'q';
265 if (ep_square() != SQ_NONE)
266 fen += square_to_string(ep_square());
274 /// Position::print() prints an ASCII representation of the position to
275 /// the standard output. If a move is given then also the san is print.
277 void Position::print(Move m) const {
279 static const string pieceLetters = " PNBRQK PNBRQK .";
281 // Check for reentrancy, as example when called from inside
282 // MovePicker that is used also here in move_to_san()
286 RequestPending = true;
288 std::cout << std::endl;
291 string col = (color_of_piece_on(move_from(m)) == BLACK ? ".." : "");
292 std::cout << "Move is: " << col << move_to_san(*this, m) << std::endl;
294 for (Rank rank = RANK_8; rank >= RANK_1; rank--)
296 std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
297 for (File file = FILE_A; file <= FILE_H; file++)
299 Square sq = make_square(file, rank);
300 Piece piece = piece_on(sq);
301 if (piece == EMPTY && square_color(sq) == WHITE)
304 char col = (color_of_piece_on(sq) == BLACK ? '=' : ' ');
305 std::cout << '|' << col << pieceLetters[piece] << col;
307 std::cout << '|' << std::endl;
309 std::cout << "+---+---+---+---+---+---+---+---+" << std::endl
310 << "Fen is: " << to_fen() << std::endl
311 << "Key is: " << st->key << std::endl;
313 RequestPending = false;
317 /// Position::copy() creates a copy of the input position.
319 void Position::copy(const Position& pos) {
321 memcpy(this, &pos, sizeof(Position));
322 saveState(); // detach and copy state info
326 /// Position:hidden_checkers<>() returns a bitboard of all pinned (against the
327 /// king) pieces for the given color and for the given pinner type. Or, when
328 /// template parameter FindPinned is false, the pieces of the given color
329 /// candidate for a discovery check against the enemy king.
330 /// Note that checkersBB bitboard must be already updated.
332 template<bool FindPinned>
333 Bitboard Position::hidden_checkers(Color c) const {
335 Bitboard pinners, result = EmptyBoardBB;
337 // Pinned pieces protect our king, dicovery checks attack
339 Square ksq = king_square(FindPinned ? c : opposite_color(c));
341 // Pinners are sliders, not checkers, that give check when
342 // candidate pinned is removed.
343 pinners = (rooks_and_queens(FindPinned ? opposite_color(c) : c) & RookPseudoAttacks[ksq])
344 | (bishops_and_queens(FindPinned ? opposite_color(c) : c) & BishopPseudoAttacks[ksq]);
346 if (FindPinned && pinners)
347 pinners &= ~st->checkersBB;
351 Square s = pop_1st_bit(&pinners);
352 Bitboard b = squares_between(s, ksq) & occupied_squares();
356 if ( !(b & (b - 1)) // Only one bit set?
357 && (b & pieces_of_color(c))) // Is an our piece?
364 /// Position:pinned_pieces() returns a bitboard of all pinned (against the
365 /// king) pieces for the given color.
367 Bitboard Position::pinned_pieces(Color c) const {
369 return hidden_checkers<true>(c);
373 /// Position:discovered_check_candidates() returns a bitboard containing all
374 /// pieces for the given side which are candidates for giving a discovered
377 Bitboard Position::discovered_check_candidates(Color c) const {
379 return hidden_checkers<false>(c);
382 /// Position::attacks_to() computes a bitboard containing all pieces which
383 /// attacks a given square.
385 Bitboard Position::attacks_to(Square s) const {
387 return (pawn_attacks(BLACK, s) & pawns(WHITE))
388 | (pawn_attacks(WHITE, s) & pawns(BLACK))
389 | (piece_attacks<KNIGHT>(s) & pieces_of_type(KNIGHT))
390 | (piece_attacks<ROOK>(s) & rooks_and_queens())
391 | (piece_attacks<BISHOP>(s) & bishops_and_queens())
392 | (piece_attacks<KING>(s) & pieces_of_type(KING));
395 /// Position::piece_attacks_square() tests whether the piece on square f
396 /// attacks square t.
398 bool Position::piece_attacks_square(Piece p, Square f, Square t) const {
400 assert(square_is_ok(f));
401 assert(square_is_ok(t));
405 case WP: return pawn_attacks_square(WHITE, f, t);
406 case BP: return pawn_attacks_square(BLACK, f, t);
407 case WN: case BN: return piece_attacks_square<KNIGHT>(f, t);
408 case WB: case BB: return piece_attacks_square<BISHOP>(f, t);
409 case WR: case BR: return piece_attacks_square<ROOK>(f, t);
410 case WQ: case BQ: return piece_attacks_square<QUEEN>(f, t);
411 case WK: case BK: return piece_attacks_square<KING>(f, t);
418 /// Position::move_attacks_square() tests whether a move from the current
419 /// position attacks a given square.
421 bool Position::move_attacks_square(Move m, Square s) const {
423 assert(move_is_ok(m));
424 assert(square_is_ok(s));
426 Square f = move_from(m), t = move_to(m);
428 assert(square_is_occupied(f));
430 if (piece_attacks_square(piece_on(f), t, s))
433 // Move the piece and scan for X-ray attacks behind it
434 Bitboard occ = occupied_squares();
435 Color us = color_of_piece_on(f);
438 Bitboard xray = ( (rook_attacks_bb(s, occ) & rooks_and_queens())
439 |(bishop_attacks_bb(s, occ) & bishops_and_queens())) & pieces_of_color(us);
441 // If we have attacks we need to verify that are caused by our move
442 // and are not already existent ones.
443 return xray && (xray ^ (xray & piece_attacks<QUEEN>(s)));
447 /// Position::find_checkers() computes the checkersBB bitboard, which
448 /// contains a nonzero bit for each checking piece (0, 1 or 2). It
449 /// currently works by calling Position::attacks_to, which is probably
450 /// inefficient. Consider rewriting this function to use the last move
451 /// played, like in non-bitboard versions of Glaurung.
453 void Position::find_checkers() {
455 Color us = side_to_move();
456 st->checkersBB = attacks_to(king_square(us), opposite_color(us));
460 /// Position::pl_move_is_legal() tests whether a pseudo-legal move is legal
462 bool Position::pl_move_is_legal(Move m) const {
464 // If we're in check, all pseudo-legal moves are legal, because our
465 // check evasion generator only generates true legal moves.
466 return is_check() || pl_move_is_legal(m, pinned_pieces(side_to_move()));
469 bool Position::pl_move_is_legal(Move m, Bitboard pinned) const {
472 assert(move_is_ok(m));
473 assert(pinned == pinned_pieces(side_to_move()));
476 // Castling moves are checked for legality during move generation.
477 if (move_is_castle(m))
480 Color us = side_to_move();
481 Square from = move_from(m);
482 Square ksq = king_square(us);
484 assert(color_of_piece_on(from) == us);
485 assert(piece_on(ksq) == piece_of_color_and_type(us, KING));
487 // En passant captures are a tricky special case. Because they are
488 // rather uncommon, we do it simply by testing whether the king is attacked
489 // after the move is made
492 Color them = opposite_color(us);
493 Square to = move_to(m);
494 Square capsq = make_square(square_file(to), square_rank(from));
495 Bitboard b = occupied_squares();
497 assert(to == ep_square());
498 assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
499 assert(piece_on(capsq) == piece_of_color_and_type(them, PAWN));
500 assert(piece_on(to) == EMPTY);
503 clear_bit(&b, capsq);
506 return !(rook_attacks_bb(ksq, b) & rooks_and_queens(them))
507 && !(bishop_attacks_bb(ksq, b) & bishops_and_queens(them));
510 // If the moving piece is a king, check whether the destination
511 // square is attacked by the opponent.
513 return !(square_is_attacked(move_to(m), opposite_color(us)));
515 // A non-king move is legal if and only if it is not pinned or it
516 // is moving along the ray towards or away from the king.
518 || !bit_is_set(pinned, from)
519 || (direction_between_squares(from, ksq) == direction_between_squares(move_to(m), ksq)));
523 /// Position::move_is_check() tests whether a pseudo-legal move is a check
525 bool Position::move_is_check(Move m) const {
527 Bitboard dc = discovered_check_candidates(side_to_move());
528 return move_is_check(m, dc);
531 bool Position::move_is_check(Move m, Bitboard dcCandidates) const {
534 assert(move_is_ok(m));
535 assert(dcCandidates == discovered_check_candidates(side_to_move()));
537 Color us = side_to_move();
538 Color them = opposite_color(us);
539 Square from = move_from(m);
540 Square to = move_to(m);
541 Square ksq = king_square(them);
543 assert(color_of_piece_on(from) == us);
544 assert(piece_on(ksq) == piece_of_color_and_type(them, KING));
546 // Proceed according to the type of the moving piece
547 switch (type_of_piece_on(from))
551 if (bit_is_set(pawn_attacks(them, ksq), to)) // Normal check?
554 if ( dcCandidates // Discovered check?
555 && bit_is_set(dcCandidates, from)
556 && (direction_between_squares(from, ksq) != direction_between_squares(to, ksq)))
559 if (move_is_promotion(m)) // Promotion with check?
561 Bitboard b = occupied_squares();
564 switch (move_promotion_piece(m))
567 return bit_is_set(piece_attacks<KNIGHT>(to), ksq);
569 return bit_is_set(bishop_attacks_bb(to, b), ksq);
571 return bit_is_set(rook_attacks_bb(to, b), ksq);
573 return bit_is_set(queen_attacks_bb(to, b), ksq);
578 // En passant capture with check? We have already handled the case
579 // of direct checks and ordinary discovered check, the only case we
580 // need to handle is the unusual case of a discovered check through the
582 else if (move_is_ep(m))
584 Square capsq = make_square(square_file(to), square_rank(from));
585 Bitboard b = occupied_squares();
587 clear_bit(&b, capsq);
589 return (rook_attacks_bb(ksq, b) & rooks_and_queens(us))
590 ||(bishop_attacks_bb(ksq, b) & bishops_and_queens(us));
594 // Test discovered check and normal check according to piece type
596 return (dcCandidates && bit_is_set(dcCandidates, from))
597 || bit_is_set(piece_attacks<KNIGHT>(ksq), to);
600 return (dcCandidates && bit_is_set(dcCandidates, from))
601 || (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to));
604 return (dcCandidates && bit_is_set(dcCandidates, from))
605 || (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to));
608 // Discovered checks are impossible!
609 assert(!bit_is_set(dcCandidates, from));
610 return ( (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to))
611 || (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to)));
615 if ( bit_is_set(dcCandidates, from)
616 && (direction_between_squares(from, ksq) != direction_between_squares(to, ksq)))
619 // Castling with check?
620 if (move_is_castle(m))
622 Square kfrom, kto, rfrom, rto;
623 Bitboard b = occupied_squares();
629 kto = relative_square(us, SQ_G1);
630 rto = relative_square(us, SQ_F1);
632 kto = relative_square(us, SQ_C1);
633 rto = relative_square(us, SQ_D1);
635 clear_bit(&b, kfrom);
636 clear_bit(&b, rfrom);
639 return bit_is_set(rook_attacks_bb(rto, b), ksq);
643 default: // NO_PIECE_TYPE
651 /// Position::update_checkers() udpates chekers info given the move. It is called
652 /// in do_move() and is faster then find_checkers().
654 template<PieceType Piece>
655 inline void Position::update_checkers(Bitboard* pCheckersBB, Square ksq, Square from,
656 Square to, Bitboard dcCandidates) {
658 const bool Bishop = (Piece == QUEEN || Piece == BISHOP);
659 const bool Rook = (Piece == QUEEN || Piece == ROOK);
660 const bool Slider = Bishop || Rook;
663 if ( ( (Bishop && bit_is_set(BishopPseudoAttacks[ksq], to))
664 || (Rook && bit_is_set(RookPseudoAttacks[ksq], to)))
665 && bit_is_set(piece_attacks<Piece>(ksq), to)) // slow, try to early skip
666 set_bit(pCheckersBB, to);
668 else if ( Piece != KING
670 && bit_is_set(piece_attacks<Piece>(ksq), to))
671 set_bit(pCheckersBB, to);
674 if (Piece != QUEEN && bit_is_set(dcCandidates, from))
677 (*pCheckersBB) |= (piece_attacks<ROOK>(ksq) & rooks_and_queens(side_to_move()));
680 (*pCheckersBB) |= (piece_attacks<BISHOP>(ksq) & bishops_and_queens(side_to_move()));
685 /// Position::do_move() makes a move, and saves all information necessary
686 /// to a StateInfo object. The move is assumed to be legal.
687 /// Pseudo-legal moves should be filtered out before this function is called.
689 void Position::do_move(Move m, StateInfo& newSt) {
691 do_move(m, newSt, discovered_check_candidates(side_to_move()));
694 void Position::do_move(Move m, StateInfo& newSt, Bitboard dcCandidates) {
697 assert(move_is_ok(m));
699 // Copy some fields of old state to our new StateInfo object except the
700 // ones which are recalculated from scratch anyway, then switch our state
701 // pointer to point to the new, ready to be updated, state.
702 struct ReducedStateInfo {
703 Key key, pawnKey, materialKey;
704 int castleRights, rule50;
706 Value mgValue, egValue;
710 memcpy(&newSt, st, sizeof(ReducedStateInfo));
711 newSt.capture = NO_PIECE_TYPE;
715 // Save the current key to the history[] array, in order to be able to
716 // detect repetition draws.
717 history[gamePly] = st->key;
719 // Increment the 50 moves rule draw counter. Resetting it to zero in the
720 // case of non-reversible moves is taken care of later.
723 // Update side to move
724 st->key ^= zobSideToMove;
726 if (move_is_castle(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);
734 bool ep = move_is_ep(m);
735 bool pm = move_is_promotion(m);
737 Piece piece = piece_on(from);
738 PieceType pt = type_of_piece(piece);
740 assert(color_of_piece_on(from) == us);
741 assert(color_of_piece_on(to) == them || square_is_empty(to));
742 assert(!(ep || pm) || piece == piece_of_color_and_type(us, PAWN));
743 assert(!pm || relative_rank(us, to) == RANK_8);
745 st->capture = ep ? PAWN : type_of_piece_on(to);
748 do_capture_move(st->capture, them, to, ep);
751 st->key ^= zobrist[us][pt][from] ^ zobrist[us][pt][to];
753 // Reset en passant square
754 if (st->epSquare != SQ_NONE)
756 st->key ^= zobEp[st->epSquare];
757 st->epSquare = SQ_NONE;
760 // Update castle rights, try to shortcut a common case
761 if ((castleRightsMask[from] & castleRightsMask[to]) != ALL_CASTLES)
763 st->key ^= zobCastle[st->castleRights];
764 st->castleRights &= castleRightsMask[from];
765 st->castleRights &= castleRightsMask[to];
766 st->key ^= zobCastle[st->castleRights];
769 // Prefetch TT access as soon as we know key is updated
770 TT.prefetch(st->key);
773 Bitboard move_bb = make_move_bb(from, to);
774 do_move_bb(&(byColorBB[us]), move_bb);
775 do_move_bb(&(byTypeBB[pt]), move_bb);
776 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
778 board[to] = board[from];
781 // If the moving piece was a pawn do some special extra work
784 // Reset rule 50 draw counter
787 // Update pawn hash key
788 st->pawnKey ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
790 // Set en passant square, only if moved pawn can be captured
791 if (abs(int(to) - int(from)) == 16)
793 if ( (us == WHITE && (pawn_attacks(WHITE, from + DELTA_N) & pawns(BLACK)))
794 || (us == BLACK && (pawn_attacks(BLACK, from + DELTA_S) & pawns(WHITE))))
796 st->epSquare = Square((int(from) + int(to)) / 2);
797 st->key ^= zobEp[st->epSquare];
802 // Update incremental scores
803 st->mgValue += pst_delta<MidGame>(piece, from, to);
804 st->egValue += pst_delta<EndGame>(piece, from, to);
806 // If the moving piece was a king, update the king square
810 // Update piece lists
811 pieceList[us][pt][index[from]] = to;
812 index[to] = index[from];
816 PieceType promotion = move_promotion_piece(m);
818 assert(promotion >= KNIGHT && promotion <= QUEEN);
820 // Insert promoted piece instead of pawn
821 clear_bit(&(byTypeBB[PAWN]), to);
822 set_bit(&(byTypeBB[promotion]), to);
823 board[to] = piece_of_color_and_type(us, promotion);
825 // Partially revert hash keys update
826 st->key ^= zobrist[us][PAWN][to] ^ zobrist[us][promotion][to];
827 st->pawnKey ^= zobrist[us][PAWN][to];
829 // Update material key
830 st->materialKey ^= zobMaterial[us][PAWN][pieceCount[us][PAWN]];
831 st->materialKey ^= zobMaterial[us][promotion][pieceCount[us][promotion]+1];
833 // Update piece counts
834 pieceCount[us][PAWN]--;
835 pieceCount[us][promotion]++;
837 // Update piece lists
838 pieceList[us][PAWN][index[from]] = pieceList[us][PAWN][pieceCount[us][PAWN]];
839 index[pieceList[us][PAWN][index[from]]] = index[from];
840 pieceList[us][promotion][pieceCount[us][promotion] - 1] = to;
841 index[to] = pieceCount[us][promotion] - 1;
843 // Partially revert and update incremental scores
844 st->mgValue -= pst<MidGame>(us, PAWN, to);
845 st->mgValue += pst<MidGame>(us, promotion, to);
846 st->egValue -= pst<EndGame>(us, PAWN, to);
847 st->egValue += pst<EndGame>(us, promotion, to);
850 st->npMaterial[us] += piece_value_midgame(promotion);
853 // Update checkers bitboard, piece must be already moved
855 st->checkersBB = attacks_to(king_square(them), us);
858 st->checkersBB = EmptyBoardBB; // FIXME EP ?
859 Square ksq = king_square(them);
862 case PAWN: update_checkers<PAWN>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
863 case KNIGHT: update_checkers<KNIGHT>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
864 case BISHOP: update_checkers<BISHOP>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
865 case ROOK: update_checkers<ROOK>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
866 case QUEEN: update_checkers<QUEEN>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
867 case KING: update_checkers<KING>(&(st->checkersBB), ksq, from, to, dcCandidates); break;
868 default: assert(false); break;
874 sideToMove = opposite_color(sideToMove);
877 st->mgValue += (sideToMove == WHITE)? TempoValueMidgame : -TempoValueMidgame;
878 st->egValue += (sideToMove == WHITE)? TempoValueEndgame : -TempoValueEndgame;
884 /// Position::do_capture_move() is a private method used to update captured
885 /// piece info. It is called from the main Position::do_move function.
887 void Position::do_capture_move(PieceType capture, Color them, Square to, bool ep) {
889 assert(capture != KING);
895 capsq = (them == BLACK)? (to - DELTA_N) : (to - DELTA_S);
897 assert(to == st->epSquare);
898 assert(relative_rank(opposite_color(them), to) == RANK_6);
899 assert(piece_on(to) == EMPTY);
900 //assert(piece_on(from) == piece_of_color_and_type(us, PAWN));
901 assert(piece_on(capsq) == piece_of_color_and_type(them, PAWN));
903 board[capsq] = EMPTY;
906 // Remove captured piece
907 clear_bit(&(byColorBB[them]), capsq);
908 clear_bit(&(byTypeBB[capture]), capsq);
909 clear_bit(&(byTypeBB[0]), capsq); // HACK: byTypeBB[0] == occupied squares
912 st->key ^= zobrist[them][capture][capsq];
914 // If the captured piece was a pawn, update pawn hash key
916 st->pawnKey ^= zobrist[them][PAWN][capsq];
918 // Update incremental scores
919 st->mgValue -= pst<MidGame>(them, capture, capsq);
920 st->egValue -= pst<EndGame>(them, capture, capsq);
924 st->npMaterial[them] -= piece_value_midgame(capture);
926 // Update material hash key
927 st->materialKey ^= zobMaterial[them][capture][pieceCount[them][capture]];
929 // Update piece count
930 pieceCount[them][capture]--;
933 pieceList[them][capture][index[capsq]] = pieceList[them][capture][pieceCount[them][capture]];
934 index[pieceList[them][capture][index[capsq]]] = index[capsq];
936 // Reset rule 50 counter
941 /// Position::do_castle_move() is a private method used to make a castling
942 /// move. It is called from the main Position::do_move function. Note that
943 /// castling moves are encoded as "king captures friendly rook" moves, for
944 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
946 void Position::do_castle_move(Move m) {
949 assert(move_is_ok(m));
950 assert(move_is_castle(m));
952 Color us = side_to_move();
953 Color them = opposite_color(us);
955 // Find source squares for king and rook
956 Square kfrom = move_from(m);
957 Square rfrom = move_to(m); // HACK: See comment at beginning of function
960 assert(piece_on(kfrom) == piece_of_color_and_type(us, KING));
961 assert(piece_on(rfrom) == piece_of_color_and_type(us, ROOK));
963 // Find destination squares for king and rook
964 if (rfrom > kfrom) // O-O
966 kto = relative_square(us, SQ_G1);
967 rto = relative_square(us, SQ_F1);
969 kto = relative_square(us, SQ_C1);
970 rto = relative_square(us, SQ_D1);
974 Bitboard kmove_bb = make_move_bb(kfrom, kto);
975 do_move_bb(&(byColorBB[us]), kmove_bb);
976 do_move_bb(&(byTypeBB[KING]), kmove_bb);
977 do_move_bb(&(byTypeBB[0]), kmove_bb); // HACK: byTypeBB[0] == occupied squares
979 Bitboard rmove_bb = make_move_bb(rfrom, rto);
980 do_move_bb(&(byColorBB[us]), rmove_bb);
981 do_move_bb(&(byTypeBB[ROOK]), rmove_bb);
982 do_move_bb(&(byTypeBB[0]), rmove_bb); // HACK: byTypeBB[0] == occupied squares
984 // Update board array
985 Piece king = piece_of_color_and_type(us, KING);
986 Piece rook = piece_of_color_and_type(us, ROOK);
987 board[kfrom] = board[rfrom] = EMPTY;
991 // Update king square
992 kingSquare[us] = kto;
994 // Update piece lists
995 pieceList[us][KING][index[kfrom]] = kto;
996 pieceList[us][ROOK][index[rfrom]] = rto;
997 int tmp = index[rfrom];
998 index[kto] = index[kfrom];
1001 // Update incremental scores
1002 st->mgValue += pst_delta<MidGame>(king, kfrom, kto);
1003 st->egValue += pst_delta<EndGame>(king, kfrom, kto);
1004 st->mgValue += pst_delta<MidGame>(rook, rfrom, rto);
1005 st->egValue += pst_delta<EndGame>(rook, rfrom, rto);
1008 st->key ^= zobrist[us][KING][kfrom] ^ zobrist[us][KING][kto];
1009 st->key ^= zobrist[us][ROOK][rfrom] ^ zobrist[us][ROOK][rto];
1011 // Clear en passant square
1012 if (st->epSquare != SQ_NONE)
1014 st->key ^= zobEp[st->epSquare];
1015 st->epSquare = SQ_NONE;
1018 // Update castling rights
1019 st->key ^= zobCastle[st->castleRights];
1020 st->castleRights &= castleRightsMask[kfrom];
1021 st->key ^= zobCastle[st->castleRights];
1023 // Reset rule 50 counter
1026 // Update checkers BB
1027 st->checkersBB = attacks_to(king_square(them), us);
1031 /// Position::undo_move() unmakes a move. When it returns, the position should
1032 /// be restored to exactly the same state as before the move was made.
1034 void Position::undo_move(Move m) {
1037 assert(move_is_ok(m));
1040 sideToMove = opposite_color(sideToMove);
1042 if (move_is_castle(m))
1043 undo_castle_move(m);
1046 Color us = side_to_move();
1047 Color them = opposite_color(us);
1048 Square from = move_from(m);
1049 Square to = move_to(m);
1050 bool ep = move_is_ep(m);
1051 bool pm = move_is_promotion(m);
1053 PieceType piece = type_of_piece_on(to);
1055 assert(square_is_empty(from));
1056 assert(color_of_piece_on(to) == us);
1057 assert(!pm || relative_rank(us, to) == RANK_8);
1058 assert(!ep || to == st->previous->epSquare);
1059 assert(!ep || relative_rank(us, to) == RANK_6);
1060 assert(!ep || piece_on(to) == piece_of_color_and_type(us, PAWN));
1064 PieceType promotion = move_promotion_piece(m);
1066 assert(piece_on(to) == piece_of_color_and_type(us, promotion));
1067 assert(promotion >= KNIGHT && promotion <= QUEEN);
1069 // Replace promoted piece with a pawn
1070 clear_bit(&(byTypeBB[promotion]), to);
1071 set_bit(&(byTypeBB[PAWN]), to);
1073 // Update piece list replacing promotion piece with a pawn
1074 pieceList[us][promotion][index[to]] = pieceList[us][promotion][pieceCount[us][promotion] - 1];
1075 index[pieceList[us][promotion][index[to]]] = index[to];
1076 pieceList[us][PAWN][pieceCount[us][PAWN]] = to;
1077 index[to] = pieceCount[us][PAWN];
1079 // Update piece counts
1080 pieceCount[us][promotion]--;
1081 pieceCount[us][PAWN]++;
1086 // Put the piece back at the source square
1087 Bitboard move_bb = make_move_bb(to, from);
1088 do_move_bb(&(byColorBB[us]), move_bb);
1089 do_move_bb(&(byTypeBB[piece]), move_bb);
1090 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
1091 board[from] = piece_of_color_and_type(us, piece);
1094 // If the moving piece was a king, update the king square
1096 kingSquare[us] = from;
1098 // Update piece list
1099 pieceList[us][piece][index[to]] = from;
1100 index[from] = index[to];
1107 capsq = (us == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1109 assert(st->capture != KING);
1110 assert(!ep || square_is_empty(capsq));
1112 // Restore the captured piece
1113 set_bit(&(byColorBB[them]), capsq);
1114 set_bit(&(byTypeBB[st->capture]), capsq);
1115 set_bit(&(byTypeBB[0]), capsq);
1116 board[capsq] = piece_of_color_and_type(them, st->capture);
1118 // Update piece list
1119 pieceList[them][st->capture][pieceCount[them][st->capture]] = capsq;
1120 index[capsq] = pieceCount[them][st->capture];
1122 // Update piece count
1123 pieceCount[them][st->capture]++;
1127 // Finally point our state pointer back to the previous state
1134 /// Position::undo_castle_move() is a private method used to unmake a castling
1135 /// move. It is called from the main Position::undo_move function. Note that
1136 /// castling moves are encoded as "king captures friendly rook" moves, for
1137 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
1139 void Position::undo_castle_move(Move m) {
1141 assert(move_is_ok(m));
1142 assert(move_is_castle(m));
1144 // When we have arrived here, some work has already been done by
1145 // Position::undo_move. In particular, the side to move has been switched,
1146 // so the code below is correct.
1147 Color us = side_to_move();
1149 // Find source squares for king and rook
1150 Square kfrom = move_from(m);
1151 Square rfrom = move_to(m); // HACK: See comment at beginning of function
1154 // Find destination squares for king and rook
1155 if (rfrom > kfrom) // O-O
1157 kto = relative_square(us, SQ_G1);
1158 rto = relative_square(us, SQ_F1);
1160 kto = relative_square(us, SQ_C1);
1161 rto = relative_square(us, SQ_D1);
1164 assert(piece_on(kto) == piece_of_color_and_type(us, KING));
1165 assert(piece_on(rto) == piece_of_color_and_type(us, ROOK));
1167 // Put the pieces back at the source square
1168 Bitboard kmove_bb = make_move_bb(kto, kfrom);
1169 do_move_bb(&(byColorBB[us]), kmove_bb);
1170 do_move_bb(&(byTypeBB[KING]), kmove_bb);
1171 do_move_bb(&(byTypeBB[0]), kmove_bb); // HACK: byTypeBB[0] == occupied squares
1173 Bitboard rmove_bb = make_move_bb(rto, rfrom);
1174 do_move_bb(&(byColorBB[us]), rmove_bb);
1175 do_move_bb(&(byTypeBB[ROOK]), rmove_bb);
1176 do_move_bb(&(byTypeBB[0]), rmove_bb); // HACK: byTypeBB[0] == occupied squares
1179 board[rto] = board[kto] = EMPTY;
1180 board[rfrom] = piece_of_color_and_type(us, ROOK);
1181 board[kfrom] = piece_of_color_and_type(us, KING);
1183 // Update king square
1184 kingSquare[us] = kfrom;
1186 // Update piece lists
1187 pieceList[us][KING][index[kto]] = kfrom;
1188 pieceList[us][ROOK][index[rto]] = rfrom;
1189 int tmp = index[rto]; // Necessary because we may have rto == kfrom in FRC.
1190 index[kfrom] = index[kto];
1195 /// Position::do_null_move makes() a "null move": It switches the side to move
1196 /// and updates the hash key without executing any move on the board.
1198 void Position::do_null_move(StateInfo& backupSt) {
1201 assert(!is_check());
1203 // Back up the information necessary to undo the null move to the supplied
1204 // StateInfo object.
1205 // Note that differently from normal case here backupSt is actually used as
1206 // a backup storage not as a new state to be used.
1207 backupSt.epSquare = st->epSquare;
1208 backupSt.key = st->key;
1209 backupSt.mgValue = st->mgValue;
1210 backupSt.egValue = st->egValue;
1211 backupSt.previous = st->previous;
1212 st->previous = &backupSt;
1214 // Save the current key to the history[] array, in order to be able to
1215 // detect repetition draws.
1216 history[gamePly] = st->key;
1218 // Update the necessary information
1219 if (st->epSquare != SQ_NONE)
1220 st->key ^= zobEp[st->epSquare];
1222 st->key ^= zobSideToMove;
1223 TT.prefetch(st->key);
1224 sideToMove = opposite_color(sideToMove);
1225 st->epSquare = SQ_NONE;
1229 st->mgValue += (sideToMove == WHITE)? TempoValueMidgame : -TempoValueMidgame;
1230 st->egValue += (sideToMove == WHITE)? TempoValueEndgame : -TempoValueEndgame;
1236 /// Position::undo_null_move() unmakes a "null move".
1238 void Position::undo_null_move() {
1241 assert(!is_check());
1243 // Restore information from the our backup StateInfo object
1244 st->epSquare = st->previous->epSquare;
1245 st->key = st->previous->key;
1246 st->mgValue = st->previous->mgValue;
1247 st->egValue = st->previous->egValue;
1248 st->previous = st->previous->previous;
1250 // Update the necessary information
1251 sideToMove = opposite_color(sideToMove);
1259 /// Position::see() is a static exchange evaluator: It tries to estimate the
1260 /// material gain or loss resulting from a move. There are three versions of
1261 /// this function: One which takes a destination square as input, one takes a
1262 /// move, and one which takes a 'from' and a 'to' square. The function does
1263 /// not yet understand promotions captures.
1265 int Position::see(Square to) const {
1267 assert(square_is_ok(to));
1268 return see(SQ_NONE, to);
1271 int Position::see(Move m) const {
1273 assert(move_is_ok(m));
1274 return see(move_from(m), move_to(m));
1277 int Position::see_sign(Move m) const {
1279 assert(move_is_ok(m));
1281 Square from = move_from(m);
1282 Square to = move_to(m);
1284 // Early return if SEE cannot be negative because capturing piece value
1285 // is not bigger then captured one.
1286 if ( midgame_value_of_piece_on(from) <= midgame_value_of_piece_on(to)
1287 && type_of_piece_on(from) != KING)
1290 return see(from, to);
1293 int Position::see(Square from, Square to) const {
1296 static const int seeValues[18] = {
1297 0, PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
1298 RookValueMidgame, QueenValueMidgame, QueenValueMidgame*10, 0,
1299 0, PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
1300 RookValueMidgame, QueenValueMidgame, QueenValueMidgame*10, 0,
1304 Bitboard attackers, stmAttackers, occ, b;
1306 assert(square_is_ok(from) || from == SQ_NONE);
1307 assert(square_is_ok(to));
1309 // Initialize colors
1310 Color us = (from != SQ_NONE ? color_of_piece_on(from) : opposite_color(color_of_piece_on(to)));
1311 Color them = opposite_color(us);
1313 // Initialize pieces
1314 Piece piece = piece_on(from);
1315 Piece capture = piece_on(to);
1317 // Find all attackers to the destination square, with the moving piece
1318 // removed, but possibly an X-ray attacker added behind it.
1319 occ = occupied_squares();
1321 // Handle en passant moves
1322 if (st->epSquare == to && type_of_piece_on(from) == PAWN)
1324 assert(capture == EMPTY);
1326 Square capQq = (side_to_move() == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1327 capture = piece_on(capQq);
1328 assert(type_of_piece_on(capQq) == PAWN);
1330 // Remove the captured pawn
1331 clear_bit(&occ, capQq);
1336 clear_bit(&occ, from);
1337 attackers = (rook_attacks_bb(to, occ) & rooks_and_queens())
1338 | (bishop_attacks_bb(to, occ) & bishops_and_queens())
1339 | (piece_attacks<KNIGHT>(to) & knights())
1340 | (piece_attacks<KING>(to) & kings())
1341 | (pawn_attacks(WHITE, to) & pawns(BLACK))
1342 | (pawn_attacks(BLACK, to) & pawns(WHITE));
1344 if (from != SQ_NONE)
1347 // If we don't have any attacker we are finished
1348 if ((attackers & pieces_of_color(us)) == EmptyBoardBB)
1351 // Locate the least valuable attacker to the destination square
1352 // and use it to initialize from square.
1354 for (pt = PAWN; !(attackers & pieces_of_color_and_type(us, pt)); pt++)
1357 from = first_1(attackers & pieces_of_color_and_type(us, pt));
1358 piece = piece_on(from);
1361 // If the opponent has no attackers we are finished
1362 stmAttackers = attackers & pieces_of_color(them);
1364 return seeValues[capture];
1366 attackers &= occ; // Remove the moving piece
1368 // The destination square is defended, which makes things rather more
1369 // difficult to compute. We proceed by building up a "swap list" containing
1370 // the material gain or loss at each stop in a sequence of captures to the
1371 // destination square, where the sides alternately capture, and always
1372 // capture with the least valuable piece. After each capture, we look for
1373 // new X-ray attacks from behind the capturing piece.
1374 int lastCapturingPieceValue = seeValues[piece];
1375 int swapList[32], n = 1;
1379 swapList[0] = seeValues[capture];
1382 // Locate the least valuable attacker for the side to move. The loop
1383 // below looks like it is potentially infinite, but it isn't. We know
1384 // that the side to move still has at least one attacker left.
1385 for (pt = PAWN; !(stmAttackers & pieces_of_type(pt)); pt++)
1388 // Remove the attacker we just found from the 'attackers' bitboard,
1389 // and scan for new X-ray attacks behind the attacker.
1390 b = stmAttackers & pieces_of_type(pt);
1391 occ ^= (b & (~b + 1));
1392 attackers |= (rook_attacks_bb(to, occ) & rooks_and_queens())
1393 | (bishop_attacks_bb(to, occ) & bishops_and_queens());
1397 // Add the new entry to the swap list
1399 swapList[n] = -swapList[n - 1] + lastCapturingPieceValue;
1402 // Remember the value of the capturing piece, and change the side to move
1403 // before beginning the next iteration
1404 lastCapturingPieceValue = seeValues[pt];
1405 c = opposite_color(c);
1406 stmAttackers = attackers & pieces_of_color(c);
1408 // Stop after a king capture
1409 if (pt == KING && stmAttackers)
1412 swapList[n++] = QueenValueMidgame*10;
1415 } while (stmAttackers);
1417 // Having built the swap list, we negamax through it to find the best
1418 // achievable score from the point of view of the side to move
1420 swapList[n-1] = Min(-swapList[n], swapList[n-1]);
1426 /// Position::saveState() copies the content of the current state
1427 /// inside startState and makes st point to it. This is needed
1428 /// when the st pointee could become stale, as example because
1429 /// the caller is about to going out of scope.
1431 void Position::saveState() {
1435 st->previous = NULL; // as a safe guard
1439 /// Position::clear() erases the position object to a pristine state, with an
1440 /// empty board, white to move, and no castling rights.
1442 void Position::clear() {
1445 memset(st, 0, sizeof(StateInfo));
1446 st->epSquare = SQ_NONE;
1448 memset(index, 0, sizeof(int) * 64);
1449 memset(byColorBB, 0, sizeof(Bitboard) * 2);
1451 for (int i = 0; i < 64; i++)
1454 for (int i = 0; i < 7; i++)
1456 byTypeBB[i] = EmptyBoardBB;
1457 pieceCount[0][i] = pieceCount[1][i] = 0;
1458 for (int j = 0; j < 8; j++)
1459 pieceList[0][i][j] = pieceList[1][i][j] = SQ_NONE;
1464 initialKFile = FILE_E;
1465 initialKRFile = FILE_H;
1466 initialQRFile = FILE_A;
1470 /// Position::reset_game_ply() simply sets gamePly to 0. It is used from the
1471 /// UCI interface code, whenever a non-reversible move is made in a
1472 /// 'position fen <fen> moves m1 m2 ...' command. This makes it possible
1473 /// for the program to handle games of arbitrary length, as long as the GUI
1474 /// handles draws by the 50 move rule correctly.
1476 void Position::reset_game_ply() {
1482 /// Position::put_piece() puts a piece on the given square of the board,
1483 /// updating the board array, bitboards, and piece counts.
1485 void Position::put_piece(Piece p, Square s) {
1487 Color c = color_of_piece(p);
1488 PieceType pt = type_of_piece(p);
1491 index[s] = pieceCount[c][pt];
1492 pieceList[c][pt][index[s]] = s;
1494 set_bit(&(byTypeBB[pt]), s);
1495 set_bit(&(byColorBB[c]), s);
1496 set_bit(&byTypeBB[0], s); // HACK: byTypeBB[0] contains all occupied squares.
1498 pieceCount[c][pt]++;
1505 /// Position::allow_oo() gives the given side the right to castle kingside.
1506 /// Used when setting castling rights during parsing of FEN strings.
1508 void Position::allow_oo(Color c) {
1510 st->castleRights |= (1 + int(c));
1514 /// Position::allow_ooo() gives the given side the right to castle queenside.
1515 /// Used when setting castling rights during parsing of FEN strings.
1517 void Position::allow_ooo(Color c) {
1519 st->castleRights |= (4 + 4*int(c));
1523 /// Position::compute_key() computes the hash key of the position. The hash
1524 /// key is usually updated incrementally as moves are made and unmade, the
1525 /// compute_key() function is only used when a new position is set up, and
1526 /// to verify the correctness of the hash key when running in debug mode.
1528 Key Position::compute_key() const {
1530 Key result = Key(0ULL);
1532 for (Square s = SQ_A1; s <= SQ_H8; s++)
1533 if (square_is_occupied(s))
1534 result ^= zobrist[color_of_piece_on(s)][type_of_piece_on(s)][s];
1536 if (ep_square() != SQ_NONE)
1537 result ^= zobEp[ep_square()];
1539 result ^= zobCastle[st->castleRights];
1540 if (side_to_move() == BLACK)
1541 result ^= zobSideToMove;
1547 /// Position::compute_pawn_key() computes the hash key of the position. The
1548 /// hash key is usually updated incrementally as moves are made and unmade,
1549 /// the compute_pawn_key() function is only used when a new position is set
1550 /// up, and to verify the correctness of the pawn hash key when running in
1553 Key Position::compute_pawn_key() const {
1555 Key result = Key(0ULL);
1559 for (Color c = WHITE; c <= BLACK; c++)
1564 s = pop_1st_bit(&b);
1565 result ^= zobrist[c][PAWN][s];
1572 /// Position::compute_material_key() computes the hash key of the position.
1573 /// The hash key is usually updated incrementally as moves are made and unmade,
1574 /// the compute_material_key() function is only used when a new position is set
1575 /// up, and to verify the correctness of the material hash key when running in
1578 Key Position::compute_material_key() const {
1580 Key result = Key(0ULL);
1581 for (Color c = WHITE; c <= BLACK; c++)
1582 for (PieceType pt = PAWN; pt <= QUEEN; pt++)
1584 int count = piece_count(c, pt);
1585 for (int i = 0; i <= count; i++)
1586 result ^= zobMaterial[c][pt][i];
1592 /// Position::compute_value() compute the incremental scores for the middle
1593 /// game and the endgame. These functions are used to initialize the incremental
1594 /// scores when a new position is set up, and to verify that the scores are correctly
1595 /// updated by do_move and undo_move when the program is running in debug mode.
1596 template<Position::GamePhase Phase>
1597 Value Position::compute_value() const {
1599 Value result = Value(0);
1603 for (Color c = WHITE; c <= BLACK; c++)
1604 for (PieceType pt = PAWN; pt <= KING; pt++)
1606 b = pieces_of_color_and_type(c, pt);
1609 s = pop_1st_bit(&b);
1610 assert(piece_on(s) == piece_of_color_and_type(c, pt));
1611 result += pst<Phase>(c, pt, s);
1615 const Value TempoValue = (Phase == MidGame ? TempoValueMidgame : TempoValueEndgame);
1616 result += (side_to_move() == WHITE)? TempoValue / 2 : -TempoValue / 2;
1621 /// Position::compute_non_pawn_material() computes the total non-pawn middle
1622 /// game material score for the given side. Material scores are updated
1623 /// incrementally during the search, this function is only used while
1624 /// initializing a new Position object.
1626 Value Position::compute_non_pawn_material(Color c) const {
1628 Value result = Value(0);
1630 for (PieceType pt = KNIGHT; pt <= QUEEN; pt++)
1632 Bitboard b = pieces_of_color_and_type(c, pt);
1635 assert(piece_on(first_1(b)) == piece_of_color_and_type(c, pt));
1637 result += piece_value_midgame(pt);
1644 /// Position::is_draw() tests whether the position is drawn by material,
1645 /// repetition, or the 50 moves rule. It does not detect stalemates, this
1646 /// must be done by the search.
1648 bool Position::is_draw() const {
1650 // Draw by material?
1652 && (non_pawn_material(WHITE) + non_pawn_material(BLACK) <= BishopValueMidgame))
1655 // Draw by the 50 moves rule?
1656 if (st->rule50 > 100 || (st->rule50 == 100 && !is_check()))
1659 // Draw by repetition?
1660 for (int i = 2; i < Min(gamePly, st->rule50); i += 2)
1661 if (history[gamePly - i] == st->key)
1668 /// Position::is_mate() returns true or false depending on whether the
1669 /// side to move is checkmated.
1671 bool Position::is_mate() const {
1673 MoveStack moves[256];
1675 return is_check() && !generate_evasions(*this, moves, pinned_pieces(sideToMove));
1679 /// Position::has_mate_threat() tests whether a given color has a mate in one
1680 /// from the current position.
1682 bool Position::has_mate_threat(Color c) {
1685 Color stm = side_to_move();
1690 // If the input color is not equal to the side to move, do a null move
1694 MoveStack mlist[120];
1696 bool result = false;
1697 Bitboard dc = discovered_check_candidates(sideToMove);
1698 Bitboard pinned = pinned_pieces(sideToMove);
1700 // Generate pseudo-legal non-capture and capture check moves
1701 count = generate_non_capture_checks(*this, mlist, dc);
1702 count += generate_captures(*this, mlist + count);
1704 // Loop through the moves, and see if one of them is mate
1705 for (int i = 0; i < count; i++)
1707 Move move = mlist[i].move;
1709 if (!pl_move_is_legal(move, pinned))
1719 // Undo null move, if necessary
1727 /// Position::init_zobrist() is a static member function which initializes the
1728 /// various arrays used to compute hash keys.
1730 void Position::init_zobrist() {
1732 for (int i = 0; i < 2; i++)
1733 for (int j = 0; j < 8; j++)
1734 for (int k = 0; k < 64; k++)
1735 zobrist[i][j][k] = Key(genrand_int64());
1737 for (int i = 0; i < 64; i++)
1738 zobEp[i] = Key(genrand_int64());
1740 for (int i = 0; i < 16; i++)
1741 zobCastle[i] = genrand_int64();
1743 zobSideToMove = genrand_int64();
1745 for (int i = 0; i < 2; i++)
1746 for (int j = 0; j < 8; j++)
1747 for (int k = 0; k < 16; k++)
1748 zobMaterial[i][j][k] = (k > 0)? Key(genrand_int64()) : Key(0LL);
1750 for (int i = 0; i < 16; i++)
1751 zobMaterial[0][KING][i] = zobMaterial[1][KING][i] = Key(0ULL);
1755 /// Position::init_piece_square_tables() initializes the piece square tables.
1756 /// This is a two-step operation: First, the white halves of the tables are
1757 /// copied from the MgPST[][] and EgPST[][] arrays, with a small random number
1758 /// added to each entry if the "Randomness" UCI parameter is non-zero.
1759 /// Second, the black halves of the tables are initialized by mirroring
1760 /// and changing the sign of the corresponding white scores.
1762 void Position::init_piece_square_tables() {
1764 int r = get_option_value_int("Randomness"), i;
1765 for (Square s = SQ_A1; s <= SQ_H8; s++)
1766 for (Piece p = WP; p <= WK; p++)
1768 i = (r == 0)? 0 : (genrand_int32() % (r*2) - r);
1769 MgPieceSquareTable[p][s] = Value(MgPST[p][s] + i);
1770 EgPieceSquareTable[p][s] = Value(EgPST[p][s] + i);
1773 for (Square s = SQ_A1; s <= SQ_H8; s++)
1774 for (Piece p = BP; p <= BK; p++)
1776 MgPieceSquareTable[p][s] = -MgPieceSquareTable[p-8][flip_square(s)];
1777 EgPieceSquareTable[p][s] = -EgPieceSquareTable[p-8][flip_square(s)];
1782 /// Position::flipped_copy() makes a copy of the input position, but with
1783 /// the white and black sides reversed. This is only useful for debugging,
1784 /// especially for finding evaluation symmetry bugs.
1786 void Position::flipped_copy(const Position& pos) {
1788 assert(pos.is_ok());
1793 for (Square s = SQ_A1; s <= SQ_H8; s++)
1794 if (!pos.square_is_empty(s))
1795 put_piece(Piece(int(pos.piece_on(s)) ^ 8), flip_square(s));
1798 sideToMove = opposite_color(pos.side_to_move());
1801 if (pos.can_castle_kingside(WHITE)) allow_oo(BLACK);
1802 if (pos.can_castle_queenside(WHITE)) allow_ooo(BLACK);
1803 if (pos.can_castle_kingside(BLACK)) allow_oo(WHITE);
1804 if (pos.can_castle_queenside(BLACK)) allow_ooo(WHITE);
1806 initialKFile = pos.initialKFile;
1807 initialKRFile = pos.initialKRFile;
1808 initialQRFile = pos.initialQRFile;
1810 for (Square sq = SQ_A1; sq <= SQ_H8; sq++)
1811 castleRightsMask[sq] = ALL_CASTLES;
1813 castleRightsMask[make_square(initialKFile, RANK_1)] ^= (WHITE_OO | WHITE_OOO);
1814 castleRightsMask[make_square(initialKFile, RANK_8)] ^= (BLACK_OO | BLACK_OOO);
1815 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
1816 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
1817 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
1818 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
1820 // En passant square
1821 if (pos.st->epSquare != SQ_NONE)
1822 st->epSquare = flip_square(pos.st->epSquare);
1828 st->key = compute_key();
1829 st->pawnKey = compute_pawn_key();
1830 st->materialKey = compute_material_key();
1832 // Incremental scores
1833 st->mgValue = compute_value<MidGame>();
1834 st->egValue = compute_value<EndGame>();
1837 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
1838 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
1844 /// Position::is_ok() performs some consitency checks for the position object.
1845 /// This is meant to be helpful when debugging.
1847 bool Position::is_ok(int* failedStep) const {
1849 // What features of the position should be verified?
1850 static const bool debugBitboards = false;
1851 static const bool debugKingCount = false;
1852 static const bool debugKingCapture = false;
1853 static const bool debugCheckerCount = false;
1854 static const bool debugKey = false;
1855 static const bool debugMaterialKey = false;
1856 static const bool debugPawnKey = false;
1857 static const bool debugIncrementalEval = false;
1858 static const bool debugNonPawnMaterial = false;
1859 static const bool debugPieceCounts = false;
1860 static const bool debugPieceList = false;
1862 if (failedStep) *failedStep = 1;
1865 if (!color_is_ok(side_to_move()))
1868 // Are the king squares in the position correct?
1869 if (failedStep) (*failedStep)++;
1870 if (piece_on(king_square(WHITE)) != WK)
1873 if (failedStep) (*failedStep)++;
1874 if (piece_on(king_square(BLACK)) != BK)
1878 if (failedStep) (*failedStep)++;
1879 if (!file_is_ok(initialKRFile))
1882 if (!file_is_ok(initialQRFile))
1885 // Do both sides have exactly one king?
1886 if (failedStep) (*failedStep)++;
1889 int kingCount[2] = {0, 0};
1890 for (Square s = SQ_A1; s <= SQ_H8; s++)
1891 if (type_of_piece_on(s) == KING)
1892 kingCount[color_of_piece_on(s)]++;
1894 if (kingCount[0] != 1 || kingCount[1] != 1)
1898 // Can the side to move capture the opponent's king?
1899 if (failedStep) (*failedStep)++;
1900 if (debugKingCapture)
1902 Color us = side_to_move();
1903 Color them = opposite_color(us);
1904 Square ksq = king_square(them);
1905 if (square_is_attacked(ksq, us))
1909 // Is there more than 2 checkers?
1910 if (failedStep) (*failedStep)++;
1911 if (debugCheckerCount && count_1s(st->checkersBB) > 2)
1915 if (failedStep) (*failedStep)++;
1918 // The intersection of the white and black pieces must be empty
1919 if ((pieces_of_color(WHITE) & pieces_of_color(BLACK)) != EmptyBoardBB)
1922 // The union of the white and black pieces must be equal to all
1924 if ((pieces_of_color(WHITE) | pieces_of_color(BLACK)) != occupied_squares())
1927 // Separate piece type bitboards must have empty intersections
1928 for (PieceType p1 = PAWN; p1 <= KING; p1++)
1929 for (PieceType p2 = PAWN; p2 <= KING; p2++)
1930 if (p1 != p2 && (pieces_of_type(p1) & pieces_of_type(p2)))
1934 // En passant square OK?
1935 if (failedStep) (*failedStep)++;
1936 if (ep_square() != SQ_NONE)
1938 // The en passant square must be on rank 6, from the point of view of the
1940 if (relative_rank(side_to_move(), ep_square()) != RANK_6)
1945 if (failedStep) (*failedStep)++;
1946 if (debugKey && st->key != compute_key())
1949 // Pawn hash key OK?
1950 if (failedStep) (*failedStep)++;
1951 if (debugPawnKey && st->pawnKey != compute_pawn_key())
1954 // Material hash key OK?
1955 if (failedStep) (*failedStep)++;
1956 if (debugMaterialKey && st->materialKey != compute_material_key())
1959 // Incremental eval OK?
1960 if (failedStep) (*failedStep)++;
1961 if (debugIncrementalEval)
1963 if (st->mgValue != compute_value<MidGame>())
1966 if (st->egValue != compute_value<EndGame>())
1970 // Non-pawn material OK?
1971 if (failedStep) (*failedStep)++;
1972 if (debugNonPawnMaterial)
1974 if (st->npMaterial[WHITE] != compute_non_pawn_material(WHITE))
1977 if (st->npMaterial[BLACK] != compute_non_pawn_material(BLACK))
1982 if (failedStep) (*failedStep)++;
1983 if (debugPieceCounts)
1984 for (Color c = WHITE; c <= BLACK; c++)
1985 for (PieceType pt = PAWN; pt <= KING; pt++)
1986 if (pieceCount[c][pt] != count_1s(pieces_of_color_and_type(c, pt)))
1989 if (failedStep) (*failedStep)++;
1992 for(Color c = WHITE; c <= BLACK; c++)
1993 for(PieceType pt = PAWN; pt <= KING; pt++)
1994 for(int i = 0; i < pieceCount[c][pt]; i++)
1996 if (piece_on(piece_list(c, pt, i)) != piece_of_color_and_type(c, pt))
1999 if (index[piece_list(c, pt, i)] != i)
2003 if (failedStep) *failedStep = 0;