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-2010 Marco Costalba, Joona Kiiski, Tord Romstad
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/>.
34 #include "ucioption.h"
40 Key Position::zobrist[2][8][64];
41 Key Position::zobEp[64];
42 Key Position::zobCastle[16];
43 Key Position::zobSideToMove;
44 Key Position::zobExclusion;
46 Score Position::PieceSquareTable[16][64];
48 // Material values arrays, indexed by Piece
49 const Value Position::PieceValueMidgame[17] = {
51 PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
52 RookValueMidgame, QueenValueMidgame, VALUE_ZERO,
53 VALUE_ZERO, VALUE_ZERO,
54 PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
55 RookValueMidgame, QueenValueMidgame
58 const Value Position::PieceValueEndgame[17] = {
60 PawnValueEndgame, KnightValueEndgame, BishopValueEndgame,
61 RookValueEndgame, QueenValueEndgame, VALUE_ZERO,
62 VALUE_ZERO, VALUE_ZERO,
63 PawnValueEndgame, KnightValueEndgame, BishopValueEndgame,
64 RookValueEndgame, QueenValueEndgame
67 // Material values array used by SEE, indexed by PieceType
68 const Value Position::seeValues[] = {
70 PawnValueMidgame, KnightValueMidgame, BishopValueMidgame,
71 RookValueMidgame, QueenValueMidgame, QueenValueMidgame*10
77 // Bonus for having the side to move (modified by Joona Kiiski)
78 const Score TempoValue = make_score(48, 22);
80 struct PieceLetters : public std::map<char, Piece> {
84 operator[]('K') = WK; operator[]('k') = BK;
85 operator[]('Q') = WQ; operator[]('q') = BQ;
86 operator[]('R') = WR; operator[]('r') = BR;
87 operator[]('B') = WB; operator[]('b') = BB;
88 operator[]('N') = WN; operator[]('n') = BN;
89 operator[]('P') = WP; operator[]('p') = BP;
90 operator[](' ') = PIECE_NONE;
91 operator[]('.') = PIECE_NONE_DARK_SQ;
94 char from_piece(Piece p) const {
96 std::map<char, Piece>::const_iterator it;
97 for (it = begin(); it != end(); ++it)
106 PieceLetters pieceLetters;
112 CheckInfo::CheckInfo(const Position& pos) {
114 Color us = pos.side_to_move();
115 Color them = opposite_color(us);
117 ksq = pos.king_square(them);
118 dcCandidates = pos.discovered_check_candidates(us);
120 checkSq[PAWN] = pos.attacks_from<PAWN>(ksq, them);
121 checkSq[KNIGHT] = pos.attacks_from<KNIGHT>(ksq);
122 checkSq[BISHOP] = pos.attacks_from<BISHOP>(ksq);
123 checkSq[ROOK] = pos.attacks_from<ROOK>(ksq);
124 checkSq[QUEEN] = checkSq[BISHOP] | checkSq[ROOK];
125 checkSq[KING] = EmptyBoardBB;
129 /// Position c'tors. Here we always create a copy of the original position
130 /// or the FEN string, we want the new born Position object do not depend
131 /// on any external data so we detach state pointer from the source one.
133 Position::Position(const Position& pos, int th) {
135 memcpy(this, &pos, sizeof(Position));
136 detach(); // Always detach() in copy c'tor to avoid surprises
141 Position::Position(const string& fen, bool isChess960, int th) {
143 from_fen(fen, isChess960);
148 /// Position::detach() copies the content of the current state and castling
149 /// masks inside the position itself. This is needed when the st pointee could
150 /// become stale, as example because the caller is about to going out of scope.
152 void Position::detach() {
156 st->previous = NULL; // as a safe guard
160 /// Position::from_fen() initializes the position object with the given FEN
161 /// string. This function is not very robust - make sure that input FENs are
162 /// correct (this is assumed to be the responsibility of the GUI).
164 void Position::from_fen(const string& fen, bool isChess960) {
166 A FEN string defines a particular position using only the ASCII character set.
168 A FEN string contains six fields. The separator between fields is a space. The fields are:
170 1) Piece placement (from white's perspective). Each rank is described, starting with rank 8 and ending
171 with rank 1; within each rank, the contents of each square are described from file A through file H.
172 Following the Standard Algebraic Notation (SAN), each piece is identified by a single letter taken
173 from the standard English names. White pieces are designated using upper-case letters ("PNBRQK")
174 while Black take lowercase ("pnbrqk"). Blank squares are noted using digits 1 through 8 (the number
175 of blank squares), and "/" separate ranks.
177 2) Active color. "w" means white moves next, "b" means black.
179 3) Castling availability. If neither side can castle, this is "-". Otherwise, this has one or more
180 letters: "K" (White can castle kingside), "Q" (White can castle queenside), "k" (Black can castle
181 kingside), and/or "q" (Black can castle queenside).
183 4) En passant target square in algebraic notation. If there's no en passant target square, this is "-".
184 If a pawn has just made a 2-square move, this is the position "behind" the pawn. This is recorded
185 regardless of whether there is a pawn in position to make an en passant capture.
187 5) Halfmove clock: This is the number of halfmoves since the last pawn advance or capture. This is used
188 to determine if a draw can be claimed under the fifty-move rule.
190 6) Fullmove number: The number of the full move. It starts at 1, and is incremented after Black's move.
195 std::istringstream ss(fen);
200 // 1. Piece placement field
201 while (ss.get(token) && token != ' ')
203 if (pieceLetters.find(token) != pieceLetters.end())
205 put_piece(pieceLetters[token], sq);
208 else if (isdigit(token))
209 sq += Square(token - '0'); // Skip the given number of files
210 else if (token == '/')
211 sq -= SQ_A3; // Jump back of 2 rows
217 if (!ss.get(token) || (token != 'w' && token != 'b'))
220 sideToMove = (token == 'w' ? WHITE : BLACK);
222 if (!ss.get(token) || token != ' ')
225 // 3. Castling availability
226 while (ss.get(token) && token != ' ')
227 if (!set_castling_rights(token))
230 // 4. En passant square
232 if ( (ss.get(col) && (col >= 'a' && col <= 'h'))
233 && (ss.get(row) && (row == '3' || row == '6')))
235 st->epSquare = make_square(file_from_char(col), rank_from_char(row));
237 // Ignore if no capture is possible
238 Color them = opposite_color(sideToMove);
239 if (!(attacks_from<PAWN>(st->epSquare, them) & pieces(PAWN, sideToMove)))
240 st->epSquare = SQ_NONE;
247 // 6. Fullmove number
249 startPosPlyCounter = (fmn - 1) * 2 + int(sideToMove == BLACK);
251 // Various initialisations
252 castleRightsMask[make_square(initialKFile, RANK_1)] ^= WHITE_OO | WHITE_OOO;
253 castleRightsMask[make_square(initialKFile, RANK_8)] ^= BLACK_OO | BLACK_OOO;
254 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
255 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
256 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
257 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
259 chess960 = isChess960;
262 st->key = compute_key();
263 st->pawnKey = compute_pawn_key();
264 st->materialKey = compute_material_key();
265 st->value = compute_value();
266 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
267 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
271 cout << "Error in FEN string: " << fen << endl;
275 /// Position::set_castling_rights() sets castling parameters castling avaiability.
276 /// This function is compatible with 3 standards: Normal FEN standard, Shredder-FEN
277 /// that uses the letters of the columns on which the rooks began the game instead
278 /// of KQkq and also X-FEN standard that, in case of Chess960, if an inner Rook is
279 /// associated with the castling right, the traditional castling tag will be replaced
280 /// by the file letter of the involved rook as for the Shredder-FEN.
282 bool Position::set_castling_rights(char token) {
284 Color c = token >= 'a' ? BLACK : WHITE;
285 Square sqA = (c == WHITE ? SQ_A1 : SQ_A8);
286 Square sqH = (c == WHITE ? SQ_H1 : SQ_H8);
287 Piece rook = (c == WHITE ? WR : BR);
289 initialKFile = square_file(king_square(c));
290 token = char(toupper(token));
294 for (Square sq = sqH; sq >= sqA; sq--)
295 if (piece_on(sq) == rook)
298 initialKRFile = square_file(sq);
302 else if (token == 'Q')
304 for (Square sq = sqA; sq <= sqH; sq++)
305 if (piece_on(sq) == rook)
308 initialQRFile = square_file(sq);
312 else if (token >= 'A' && token <= 'H')
314 File rookFile = File(token - 'A') + FILE_A;
315 if (rookFile < initialKFile)
318 initialQRFile = rookFile;
323 initialKRFile = rookFile;
333 /// Position::to_fen() returns a FEN representation of the position. In case
334 /// of Chess960 the Shredder-FEN notation is used. Mainly a debugging function.
336 const string Position::to_fen() const {
342 for (Rank rank = RANK_8; rank >= RANK_1; rank--, fen += '/')
344 for (File file = FILE_A; file <= FILE_H; file++)
346 sq = make_square(file, rank);
348 if (square_is_occupied(sq))
355 fen += pieceLetters.from_piece(piece_on(sq));
367 fen += (sideToMove == WHITE ? " w " : " b ");
369 if (st->castleRights != CASTLES_NONE)
371 if (can_castle_kingside(WHITE))
372 fen += chess960 ? char(toupper(file_to_char(initialKRFile))) : 'K';
374 if (can_castle_queenside(WHITE))
375 fen += chess960 ? char(toupper(file_to_char(initialQRFile))) : 'Q';
377 if (can_castle_kingside(BLACK))
378 fen += chess960 ? file_to_char(initialKRFile) : 'k';
380 if (can_castle_queenside(BLACK))
381 fen += chess960 ? file_to_char(initialQRFile) : 'q';
385 fen += (ep_square() == SQ_NONE ? " -" : " " + square_to_string(ep_square()));
390 /// Position::print() prints an ASCII representation of the position to
391 /// the standard output. If a move is given then also the san is printed.
393 void Position::print(Move move) const {
395 const char* dottedLine = "\n+---+---+---+---+---+---+---+---+\n";
399 Position p(*this, thread());
400 string dd = (color_of_piece_on(move_from(move)) == BLACK ? ".." : "");
401 cout << "\nMove is: " << dd << move_to_san(p, move);
404 for (Rank rank = RANK_8; rank >= RANK_1; rank--)
406 cout << dottedLine << '|';
407 for (File file = FILE_A; file <= FILE_H; file++)
409 Square sq = make_square(file, rank);
410 Piece piece = piece_on(sq);
412 if (piece == PIECE_NONE && square_color(sq) == DARK)
413 piece = PIECE_NONE_DARK_SQ;
415 char c = (color_of_piece_on(sq) == BLACK ? '=' : ' ');
416 cout << c << pieceLetters.from_piece(piece) << c << '|';
419 cout << dottedLine << "Fen is: " << to_fen() << "\nKey is: " << st->key << endl;
423 /// Position:hidden_checkers<>() returns a bitboard of all pinned (against the
424 /// king) pieces for the given color and for the given pinner type. Or, when
425 /// template parameter FindPinned is false, the pieces of the given color
426 /// candidate for a discovery check against the enemy king.
427 /// Bitboard checkersBB must be already updated when looking for pinners.
429 template<bool FindPinned>
430 Bitboard Position::hidden_checkers(Color c) const {
432 Bitboard result = EmptyBoardBB;
433 Bitboard pinners = pieces_of_color(FindPinned ? opposite_color(c) : c);
435 // Pinned pieces protect our king, dicovery checks attack
437 Square ksq = king_square(FindPinned ? c : opposite_color(c));
439 // Pinners are sliders, not checkers, that give check when candidate pinned is removed
440 pinners &= (pieces(ROOK, QUEEN) & RookPseudoAttacks[ksq]) | (pieces(BISHOP, QUEEN) & BishopPseudoAttacks[ksq]);
442 if (FindPinned && pinners)
443 pinners &= ~st->checkersBB;
447 Square s = pop_1st_bit(&pinners);
448 Bitboard b = squares_between(s, ksq) & occupied_squares();
452 if ( !(b & (b - 1)) // Only one bit set?
453 && (b & pieces_of_color(c))) // Is an our piece?
460 /// Position:pinned_pieces() returns a bitboard of all pinned (against the
461 /// king) pieces for the given color. Note that checkersBB bitboard must
462 /// be already updated.
464 Bitboard Position::pinned_pieces(Color c) const {
466 return hidden_checkers<true>(c);
470 /// Position:discovered_check_candidates() returns a bitboard containing all
471 /// pieces for the given side which are candidates for giving a discovered
472 /// check. Contrary to pinned_pieces() here there is no need of checkersBB
473 /// to be already updated.
475 Bitboard Position::discovered_check_candidates(Color c) const {
477 return hidden_checkers<false>(c);
480 /// Position::attackers_to() computes a bitboard containing all pieces which
481 /// attacks a given square.
483 Bitboard Position::attackers_to(Square s) const {
485 return (attacks_from<PAWN>(s, BLACK) & pieces(PAWN, WHITE))
486 | (attacks_from<PAWN>(s, WHITE) & pieces(PAWN, BLACK))
487 | (attacks_from<KNIGHT>(s) & pieces(KNIGHT))
488 | (attacks_from<ROOK>(s) & pieces(ROOK, QUEEN))
489 | (attacks_from<BISHOP>(s) & pieces(BISHOP, QUEEN))
490 | (attacks_from<KING>(s) & pieces(KING));
493 /// Position::attacks_from() computes a bitboard of all attacks
494 /// of a given piece put in a given square.
496 Bitboard Position::attacks_from(Piece p, Square s) const {
498 assert(square_is_ok(s));
502 case WB: case BB: return attacks_from<BISHOP>(s);
503 case WR: case BR: return attacks_from<ROOK>(s);
504 case WQ: case BQ: return attacks_from<QUEEN>(s);
505 default: return StepAttacksBB[p][s];
509 Bitboard Position::attacks_from(Piece p, Square s, Bitboard occ) {
511 assert(square_is_ok(s));
515 case WB: case BB: return bishop_attacks_bb(s, occ);
516 case WR: case BR: return rook_attacks_bb(s, occ);
517 case WQ: case BQ: return bishop_attacks_bb(s, occ) | rook_attacks_bb(s, occ);
518 default: return StepAttacksBB[p][s];
523 /// Position::move_attacks_square() tests whether a move from the current
524 /// position attacks a given square.
526 bool Position::move_attacks_square(Move m, Square s) const {
528 assert(move_is_ok(m));
529 assert(square_is_ok(s));
532 Square f = move_from(m), t = move_to(m);
534 assert(square_is_occupied(f));
536 if (bit_is_set(attacks_from(piece_on(f), t), s))
539 // Move the piece and scan for X-ray attacks behind it
540 occ = occupied_squares();
541 do_move_bb(&occ, make_move_bb(f, t));
542 xray = ( (rook_attacks_bb(s, occ) & pieces(ROOK, QUEEN))
543 |(bishop_attacks_bb(s, occ) & pieces(BISHOP, QUEEN)))
544 & pieces_of_color(color_of_piece_on(f));
546 // If we have attacks we need to verify that are caused by our move
547 // and are not already existent ones.
548 return xray && (xray ^ (xray & attacks_from<QUEEN>(s)));
552 /// Position::find_checkers() computes the checkersBB bitboard, which
553 /// contains a nonzero bit for each checking piece (0, 1 or 2). It
554 /// currently works by calling Position::attackers_to, which is probably
555 /// inefficient. Consider rewriting this function to use the last move
556 /// played, like in non-bitboard versions of Glaurung.
558 void Position::find_checkers() {
560 Color us = side_to_move();
561 st->checkersBB = attackers_to(king_square(us)) & pieces_of_color(opposite_color(us));
565 /// Position::pl_move_is_legal() tests whether a pseudo-legal move is legal
567 bool Position::pl_move_is_legal(Move m, Bitboard pinned) const {
570 assert(move_is_ok(m));
571 assert(pinned == pinned_pieces(side_to_move()));
573 // En passant captures are a tricky special case. Because they are
574 // rather uncommon, we do it simply by testing whether the king is attacked
575 // after the move is made
578 Color us = side_to_move();
579 Color them = opposite_color(us);
580 Square from = move_from(m);
581 Square to = move_to(m);
582 Square capsq = make_square(square_file(to), square_rank(from));
583 Square ksq = king_square(us);
584 Bitboard b = occupied_squares();
586 assert(to == ep_square());
587 assert(piece_on(from) == make_piece(us, PAWN));
588 assert(piece_on(capsq) == make_piece(them, PAWN));
589 assert(piece_on(to) == PIECE_NONE);
592 clear_bit(&b, capsq);
595 return !(rook_attacks_bb(ksq, b) & pieces(ROOK, QUEEN, them))
596 && !(bishop_attacks_bb(ksq, b) & pieces(BISHOP, QUEEN, them));
599 Color us = side_to_move();
600 Square from = move_from(m);
602 assert(color_of_piece_on(from) == us);
603 assert(piece_on(king_square(us)) == make_piece(us, KING));
605 // If the moving piece is a king, check whether the destination
606 // square is attacked by the opponent. Castling moves are checked
607 // for legality during move generation.
608 if (type_of_piece_on(from) == KING)
609 return move_is_castle(m) || !(attackers_to(move_to(m)) & pieces_of_color(opposite_color(us)));
611 // A non-king move is legal if and only if it is not pinned or it
612 // is moving along the ray towards or away from the king.
614 || !bit_is_set(pinned, from)
615 || squares_aligned(from, move_to(m), king_square(us));
619 /// Position::pl_move_is_evasion() tests whether a pseudo-legal move is a legal evasion
621 bool Position::pl_move_is_evasion(Move m, Bitboard pinned) const
625 Color us = side_to_move();
626 Square from = move_from(m);
627 Square to = move_to(m);
629 // King moves and en-passant captures are verified in pl_move_is_legal()
630 if (type_of_piece_on(from) == KING || move_is_ep(m))
631 return pl_move_is_legal(m, pinned);
633 Bitboard target = checkers();
634 Square checksq = pop_1st_bit(&target);
636 if (target) // double check ?
639 // Our move must be a blocking evasion or a capture of the checking piece
640 target = squares_between(checksq, king_square(us)) | checkers();
641 return bit_is_set(target, to) && pl_move_is_legal(m, pinned);
644 /// Position::move_is_legal() takes a position and a (not necessarily pseudo-legal)
645 /// move and tests whether the move is legal. This version is not very fast and
646 /// should be used only in non time-critical paths.
648 bool Position::move_is_legal(const Move m) const {
650 MoveStack mlist[MAX_MOVES];
651 MoveStack *cur, *last = generate<MV_PSEUDO_LEGAL>(*this, mlist);
653 for (cur = mlist; cur != last; cur++)
655 return pl_move_is_legal(m, pinned_pieces(sideToMove));
661 /// Fast version of Position::move_is_legal() that takes a position a move and
662 /// a bitboard of pinned pieces as input, and tests whether the move is legal.
664 bool Position::move_is_legal(const Move m, Bitboard pinned) const {
667 assert(pinned == pinned_pieces(sideToMove));
669 Color us = sideToMove;
670 Color them = opposite_color(sideToMove);
671 Square from = move_from(m);
672 Square to = move_to(m);
673 Piece pc = piece_on(from);
675 // Use a slower but simpler function for uncommon cases
676 if (move_is_special(m))
677 return move_is_legal(m);
679 // Is not a promotion, so promotion piece must be empty
680 if (move_promotion_piece(m) - 2 != PIECE_TYPE_NONE)
683 // If the from square is not occupied by a piece belonging to the side to
684 // move, the move is obviously not legal.
685 if (pc == PIECE_NONE || color_of_piece(pc) != us)
688 // The destination square cannot be occupied by a friendly piece
689 if (color_of_piece_on(to) == us)
692 // Handle the special case of a pawn move
693 if (type_of_piece(pc) == PAWN)
695 // Move direction must be compatible with pawn color
696 int direction = to - from;
697 if ((us == WHITE) != (direction > 0))
700 // We have already handled promotion moves, so destination
701 // cannot be on the 8/1th rank.
702 if (square_rank(to) == RANK_8 || square_rank(to) == RANK_1)
705 // Proceed according to the square delta between the origin and
706 // destination squares.
713 // Capture. The destination square must be occupied by an enemy
714 // piece (en passant captures was handled earlier).
715 if (color_of_piece_on(to) != them)
721 // Pawn push. The destination square must be empty.
722 if (!square_is_empty(to))
727 // Double white pawn push. The destination square must be on the fourth
728 // rank, and both the destination square and the square between the
729 // source and destination squares must be empty.
730 if ( square_rank(to) != RANK_4
731 || !square_is_empty(to)
732 || !square_is_empty(from + DELTA_N))
737 // Double black pawn push. The destination square must be on the fifth
738 // rank, and both the destination square and the square between the
739 // source and destination squares must be empty.
740 if ( square_rank(to) != RANK_5
741 || !square_is_empty(to)
742 || !square_is_empty(from + DELTA_S))
750 else if (!bit_is_set(attacks_from(pc, from), to))
753 // The move is pseudo-legal, check if it is also legal
754 return in_check() ? pl_move_is_evasion(m, pinned) : pl_move_is_legal(m, pinned);
758 /// Position::move_gives_check() tests whether a pseudo-legal move is a check
760 bool Position::move_gives_check(Move m) const {
762 return move_gives_check(m, CheckInfo(*this));
765 bool Position::move_gives_check(Move m, const CheckInfo& ci) const {
768 assert(move_is_ok(m));
769 assert(ci.dcCandidates == discovered_check_candidates(side_to_move()));
770 assert(color_of_piece_on(move_from(m)) == side_to_move());
771 assert(piece_on(ci.ksq) == make_piece(opposite_color(side_to_move()), KING));
773 Square from = move_from(m);
774 Square to = move_to(m);
775 PieceType pt = type_of_piece_on(from);
778 if (bit_is_set(ci.checkSq[pt], to))
782 if (ci.dcCandidates && bit_is_set(ci.dcCandidates, from))
784 // For pawn and king moves we need to verify also direction
785 if ( (pt != PAWN && pt != KING)
786 || !squares_aligned(from, to, ci.ksq))
790 // Can we skip the ugly special cases ?
791 if (!move_is_special(m))
794 Color us = side_to_move();
795 Bitboard b = occupied_squares();
797 // Promotion with check ?
798 if (move_is_promotion(m))
802 switch (move_promotion_piece(m))
805 return bit_is_set(attacks_from<KNIGHT>(to), ci.ksq);
807 return bit_is_set(bishop_attacks_bb(to, b), ci.ksq);
809 return bit_is_set(rook_attacks_bb(to, b), ci.ksq);
811 return bit_is_set(queen_attacks_bb(to, b), ci.ksq);
817 // En passant capture with check ? We have already handled the case
818 // of direct checks and ordinary discovered check, the only case we
819 // need to handle is the unusual case of a discovered check through
820 // the captured pawn.
823 Square capsq = make_square(square_file(to), square_rank(from));
825 clear_bit(&b, capsq);
827 return (rook_attacks_bb(ci.ksq, b) & pieces(ROOK, QUEEN, us))
828 ||(bishop_attacks_bb(ci.ksq, b) & pieces(BISHOP, QUEEN, us));
831 // Castling with check ?
832 if (move_is_castle(m))
834 Square kfrom, kto, rfrom, rto;
840 kto = relative_square(us, SQ_G1);
841 rto = relative_square(us, SQ_F1);
843 kto = relative_square(us, SQ_C1);
844 rto = relative_square(us, SQ_D1);
846 clear_bit(&b, kfrom);
847 clear_bit(&b, rfrom);
850 return bit_is_set(rook_attacks_bb(rto, b), ci.ksq);
857 /// Position::do_setup_move() makes a permanent move on the board. It should
858 /// be used when setting up a position on board. You can't undo the move.
860 void Position::do_setup_move(Move m) {
866 // Reset "game ply" in case we made a non-reversible move.
867 // "game ply" is used for repetition detection.
871 // Update the number of plies played from the starting position
872 startPosPlyCounter++;
874 // Our StateInfo newSt is about going out of scope so copy
875 // its content before it disappears.
880 /// Position::do_move() makes a move, and saves all information necessary
881 /// to a StateInfo object. The move is assumed to be legal. Pseudo-legal
882 /// moves should be filtered out before this function is called.
884 void Position::do_move(Move m, StateInfo& newSt) {
887 do_move(m, newSt, ci, move_gives_check(m, ci));
890 void Position::do_move(Move m, StateInfo& newSt, const CheckInfo& ci, bool moveIsCheck) {
893 assert(move_is_ok(m));
894 assert(&newSt != st);
899 // Copy some fields of old state to our new StateInfo object except the
900 // ones which are recalculated from scratch anyway, then switch our state
901 // pointer to point to the new, ready to be updated, state.
902 struct ReducedStateInfo {
903 Key pawnKey, materialKey;
904 int castleRights, rule50, gamePly, pliesFromNull;
910 memcpy(&newSt, st, sizeof(ReducedStateInfo));
915 // Save the current key to the history[] array, in order to be able to
916 // detect repetition draws.
917 history[st->gamePly++] = key;
919 // Update side to move
920 key ^= zobSideToMove;
922 // Increment the 50 moves rule draw counter. Resetting it to zero in the
923 // case of non-reversible moves is taken care of later.
927 if (move_is_castle(m))
934 Color us = side_to_move();
935 Color them = opposite_color(us);
936 Square from = move_from(m);
937 Square to = move_to(m);
938 bool ep = move_is_ep(m);
939 bool pm = move_is_promotion(m);
941 Piece piece = piece_on(from);
942 PieceType pt = type_of_piece(piece);
943 PieceType capture = ep ? PAWN : type_of_piece_on(to);
945 assert(color_of_piece_on(from) == us);
946 assert(color_of_piece_on(to) == them || square_is_empty(to));
947 assert(!(ep || pm) || piece == make_piece(us, PAWN));
948 assert(!pm || relative_rank(us, to) == RANK_8);
951 do_capture_move(key, capture, them, to, ep);
954 key ^= zobrist[us][pt][from] ^ zobrist[us][pt][to];
956 // Reset en passant square
957 if (st->epSquare != SQ_NONE)
959 key ^= zobEp[st->epSquare];
960 st->epSquare = SQ_NONE;
963 // Update castle rights, try to shortcut a common case
964 int cm = castleRightsMask[from] & castleRightsMask[to];
965 if (cm != ALL_CASTLES && ((cm & st->castleRights) != st->castleRights))
967 key ^= zobCastle[st->castleRights];
968 st->castleRights &= castleRightsMask[from];
969 st->castleRights &= castleRightsMask[to];
970 key ^= zobCastle[st->castleRights];
973 // Prefetch TT access as soon as we know key is updated
974 prefetch((char*)TT.first_entry(key));
977 Bitboard move_bb = make_move_bb(from, to);
978 do_move_bb(&(byColorBB[us]), move_bb);
979 do_move_bb(&(byTypeBB[pt]), move_bb);
980 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
982 board[to] = board[from];
983 board[from] = PIECE_NONE;
985 // Update piece lists, note that index[from] is not updated and
986 // becomes stale. This works as long as index[] is accessed just
987 // by known occupied squares.
988 index[to] = index[from];
989 pieceList[us][pt][index[to]] = to;
991 // If the moving piece was a pawn do some special extra work
994 // Reset rule 50 draw counter
997 // Update pawn hash key and prefetch in L1/L2 cache
998 st->pawnKey ^= zobrist[us][PAWN][from] ^ zobrist[us][PAWN][to];
1000 // Set en passant square, only if moved pawn can be captured
1001 if ((to ^ from) == 16)
1003 if (attacks_from<PAWN>(from + (us == WHITE ? DELTA_N : DELTA_S), us) & pieces(PAWN, them))
1005 st->epSquare = Square((int(from) + int(to)) / 2);
1006 key ^= zobEp[st->epSquare];
1010 if (pm) // promotion ?
1012 PieceType promotion = move_promotion_piece(m);
1014 assert(promotion >= KNIGHT && promotion <= QUEEN);
1016 // Insert promoted piece instead of pawn
1017 clear_bit(&(byTypeBB[PAWN]), to);
1018 set_bit(&(byTypeBB[promotion]), to);
1019 board[to] = make_piece(us, promotion);
1021 // Update piece counts
1022 pieceCount[us][promotion]++;
1023 pieceCount[us][PAWN]--;
1025 // Update material key
1026 st->materialKey ^= zobrist[us][PAWN][pieceCount[us][PAWN]];
1027 st->materialKey ^= zobrist[us][promotion][pieceCount[us][promotion]-1];
1029 // Update piece lists, move the last pawn at index[to] position
1030 // and shrink the list. Add a new promotion piece to the list.
1031 Square lastPawnSquare = pieceList[us][PAWN][pieceCount[us][PAWN]];
1032 index[lastPawnSquare] = index[to];
1033 pieceList[us][PAWN][index[lastPawnSquare]] = lastPawnSquare;
1034 pieceList[us][PAWN][pieceCount[us][PAWN]] = SQ_NONE;
1035 index[to] = pieceCount[us][promotion] - 1;
1036 pieceList[us][promotion][index[to]] = to;
1038 // Partially revert hash keys update
1039 key ^= zobrist[us][PAWN][to] ^ zobrist[us][promotion][to];
1040 st->pawnKey ^= zobrist[us][PAWN][to];
1042 // Partially revert and update incremental scores
1043 st->value -= pst(us, PAWN, to);
1044 st->value += pst(us, promotion, to);
1047 st->npMaterial[us] += PieceValueMidgame[promotion];
1051 // Prefetch pawn and material hash tables
1052 Threads[threadID].pawnTable.prefetch(st->pawnKey);
1053 Threads[threadID].materialTable.prefetch(st->materialKey);
1055 // Update incremental scores
1056 st->value += pst_delta(piece, from, to);
1058 // Set capture piece
1059 st->capturedType = capture;
1061 // Update the key with the final value
1064 // Update checkers bitboard, piece must be already moved
1065 st->checkersBB = EmptyBoardBB;
1070 st->checkersBB = attackers_to(king_square(them)) & pieces_of_color(us);
1074 if (bit_is_set(ci.checkSq[pt], to))
1075 st->checkersBB = SetMaskBB[to];
1078 if (ci.dcCandidates && bit_is_set(ci.dcCandidates, from))
1081 st->checkersBB |= (attacks_from<ROOK>(ci.ksq) & pieces(ROOK, QUEEN, us));
1084 st->checkersBB |= (attacks_from<BISHOP>(ci.ksq) & pieces(BISHOP, QUEEN, us));
1090 sideToMove = opposite_color(sideToMove);
1091 st->value += (sideToMove == WHITE ? TempoValue : -TempoValue);
1097 /// Position::do_capture_move() is a private method used to update captured
1098 /// piece info. It is called from the main Position::do_move function.
1100 void Position::do_capture_move(Key& key, PieceType capture, Color them, Square to, bool ep) {
1102 assert(capture != KING);
1106 // If the captured piece was a pawn, update pawn hash key,
1107 // otherwise update non-pawn material.
1108 if (capture == PAWN)
1110 if (ep) // en passant ?
1112 capsq = (them == BLACK)? (to - DELTA_N) : (to - DELTA_S);
1114 assert(to == st->epSquare);
1115 assert(relative_rank(opposite_color(them), to) == RANK_6);
1116 assert(piece_on(to) == PIECE_NONE);
1117 assert(piece_on(capsq) == make_piece(them, PAWN));
1119 board[capsq] = PIECE_NONE;
1121 st->pawnKey ^= zobrist[them][PAWN][capsq];
1124 st->npMaterial[them] -= PieceValueMidgame[capture];
1126 // Remove captured piece
1127 clear_bit(&(byColorBB[them]), capsq);
1128 clear_bit(&(byTypeBB[capture]), capsq);
1129 clear_bit(&(byTypeBB[0]), capsq);
1132 key ^= zobrist[them][capture][capsq];
1134 // Update incremental scores
1135 st->value -= pst(them, capture, capsq);
1137 // Update piece count
1138 pieceCount[them][capture]--;
1140 // Update material hash key
1141 st->materialKey ^= zobrist[them][capture][pieceCount[them][capture]];
1143 // Update piece list, move the last piece at index[capsq] position
1145 // WARNING: This is a not perfectly revresible operation. When we
1146 // will reinsert the captured piece in undo_move() we will put it
1147 // at the end of the list and not in its original place, it means
1148 // index[] and pieceList[] are not guaranteed to be invariant to a
1149 // do_move() + undo_move() sequence.
1150 Square lastPieceSquare = pieceList[them][capture][pieceCount[them][capture]];
1151 index[lastPieceSquare] = index[capsq];
1152 pieceList[them][capture][index[lastPieceSquare]] = lastPieceSquare;
1153 pieceList[them][capture][pieceCount[them][capture]] = SQ_NONE;
1155 // Reset rule 50 counter
1160 /// Position::do_castle_move() is a private method used to make a castling
1161 /// move. It is called from the main Position::do_move function. Note that
1162 /// castling moves are encoded as "king captures friendly rook" moves, for
1163 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
1165 void Position::do_castle_move(Move m) {
1167 assert(move_is_ok(m));
1168 assert(move_is_castle(m));
1170 Color us = side_to_move();
1171 Color them = opposite_color(us);
1173 // Reset capture field
1174 st->capturedType = PIECE_TYPE_NONE;
1176 // Find source squares for king and rook
1177 Square kfrom = move_from(m);
1178 Square rfrom = move_to(m); // HACK: See comment at beginning of function
1181 assert(piece_on(kfrom) == make_piece(us, KING));
1182 assert(piece_on(rfrom) == make_piece(us, ROOK));
1184 // Find destination squares for king and rook
1185 if (rfrom > kfrom) // O-O
1187 kto = relative_square(us, SQ_G1);
1188 rto = relative_square(us, SQ_F1);
1190 kto = relative_square(us, SQ_C1);
1191 rto = relative_square(us, SQ_D1);
1194 // Remove pieces from source squares:
1195 clear_bit(&(byColorBB[us]), kfrom);
1196 clear_bit(&(byTypeBB[KING]), kfrom);
1197 clear_bit(&(byTypeBB[0]), kfrom); // HACK: byTypeBB[0] == occupied squares
1198 clear_bit(&(byColorBB[us]), rfrom);
1199 clear_bit(&(byTypeBB[ROOK]), rfrom);
1200 clear_bit(&(byTypeBB[0]), rfrom); // HACK: byTypeBB[0] == occupied squares
1202 // Put pieces on destination squares:
1203 set_bit(&(byColorBB[us]), kto);
1204 set_bit(&(byTypeBB[KING]), kto);
1205 set_bit(&(byTypeBB[0]), kto); // HACK: byTypeBB[0] == occupied squares
1206 set_bit(&(byColorBB[us]), rto);
1207 set_bit(&(byTypeBB[ROOK]), rto);
1208 set_bit(&(byTypeBB[0]), rto); // HACK: byTypeBB[0] == occupied squares
1210 // Update board array
1211 Piece king = make_piece(us, KING);
1212 Piece rook = make_piece(us, ROOK);
1213 board[kfrom] = board[rfrom] = PIECE_NONE;
1217 // Update piece lists
1218 pieceList[us][KING][index[kfrom]] = kto;
1219 pieceList[us][ROOK][index[rfrom]] = rto;
1220 int tmp = index[rfrom]; // In Chess960 could be rto == kfrom
1221 index[kto] = index[kfrom];
1224 // Update incremental scores
1225 st->value += pst_delta(king, kfrom, kto);
1226 st->value += pst_delta(rook, rfrom, rto);
1229 st->key ^= zobrist[us][KING][kfrom] ^ zobrist[us][KING][kto];
1230 st->key ^= zobrist[us][ROOK][rfrom] ^ zobrist[us][ROOK][rto];
1232 // Clear en passant square
1233 if (st->epSquare != SQ_NONE)
1235 st->key ^= zobEp[st->epSquare];
1236 st->epSquare = SQ_NONE;
1239 // Update castling rights
1240 st->key ^= zobCastle[st->castleRights];
1241 st->castleRights &= castleRightsMask[kfrom];
1242 st->key ^= zobCastle[st->castleRights];
1244 // Reset rule 50 counter
1247 // Update checkers BB
1248 st->checkersBB = attackers_to(king_square(them)) & pieces_of_color(us);
1251 sideToMove = opposite_color(sideToMove);
1252 st->value += (sideToMove == WHITE ? TempoValue : -TempoValue);
1258 /// Position::undo_move() unmakes a move. When it returns, the position should
1259 /// be restored to exactly the same state as before the move was made.
1261 void Position::undo_move(Move m) {
1264 assert(move_is_ok(m));
1266 sideToMove = opposite_color(sideToMove);
1268 if (move_is_castle(m))
1270 undo_castle_move(m);
1274 Color us = side_to_move();
1275 Color them = opposite_color(us);
1276 Square from = move_from(m);
1277 Square to = move_to(m);
1278 bool ep = move_is_ep(m);
1279 bool pm = move_is_promotion(m);
1281 PieceType pt = type_of_piece_on(to);
1283 assert(square_is_empty(from));
1284 assert(color_of_piece_on(to) == us);
1285 assert(!pm || relative_rank(us, to) == RANK_8);
1286 assert(!ep || to == st->previous->epSquare);
1287 assert(!ep || relative_rank(us, to) == RANK_6);
1288 assert(!ep || piece_on(to) == make_piece(us, PAWN));
1290 if (pm) // promotion ?
1292 PieceType promotion = move_promotion_piece(m);
1295 assert(promotion >= KNIGHT && promotion <= QUEEN);
1296 assert(piece_on(to) == make_piece(us, promotion));
1298 // Replace promoted piece with a pawn
1299 clear_bit(&(byTypeBB[promotion]), to);
1300 set_bit(&(byTypeBB[PAWN]), to);
1302 // Update piece counts
1303 pieceCount[us][promotion]--;
1304 pieceCount[us][PAWN]++;
1306 // Update piece list replacing promotion piece with a pawn
1307 Square lastPromotionSquare = pieceList[us][promotion][pieceCount[us][promotion]];
1308 index[lastPromotionSquare] = index[to];
1309 pieceList[us][promotion][index[lastPromotionSquare]] = lastPromotionSquare;
1310 pieceList[us][promotion][pieceCount[us][promotion]] = SQ_NONE;
1311 index[to] = pieceCount[us][PAWN] - 1;
1312 pieceList[us][PAWN][index[to]] = to;
1315 // Put the piece back at the source square
1316 Bitboard move_bb = make_move_bb(to, from);
1317 do_move_bb(&(byColorBB[us]), move_bb);
1318 do_move_bb(&(byTypeBB[pt]), move_bb);
1319 do_move_bb(&(byTypeBB[0]), move_bb); // HACK: byTypeBB[0] == occupied squares
1321 board[from] = make_piece(us, pt);
1322 board[to] = PIECE_NONE;
1324 // Update piece list
1325 index[from] = index[to];
1326 pieceList[us][pt][index[from]] = from;
1328 if (st->capturedType)
1333 capsq = (us == WHITE)? (to - DELTA_N) : (to - DELTA_S);
1335 assert(st->capturedType != KING);
1336 assert(!ep || square_is_empty(capsq));
1338 // Restore the captured piece
1339 set_bit(&(byColorBB[them]), capsq);
1340 set_bit(&(byTypeBB[st->capturedType]), capsq);
1341 set_bit(&(byTypeBB[0]), capsq);
1343 board[capsq] = make_piece(them, st->capturedType);
1345 // Update piece count
1346 pieceCount[them][st->capturedType]++;
1348 // Update piece list, add a new captured piece in capsq square
1349 index[capsq] = pieceCount[them][st->capturedType] - 1;
1350 pieceList[them][st->capturedType][index[capsq]] = capsq;
1353 // Finally point our state pointer back to the previous state
1360 /// Position::undo_castle_move() is a private method used to unmake a castling
1361 /// move. It is called from the main Position::undo_move function. Note that
1362 /// castling moves are encoded as "king captures friendly rook" moves, for
1363 /// instance white short castling in a non-Chess960 game is encoded as e1h1.
1365 void Position::undo_castle_move(Move m) {
1367 assert(move_is_ok(m));
1368 assert(move_is_castle(m));
1370 // When we have arrived here, some work has already been done by
1371 // Position::undo_move. In particular, the side to move has been switched,
1372 // so the code below is correct.
1373 Color us = side_to_move();
1375 // Find source squares for king and rook
1376 Square kfrom = move_from(m);
1377 Square rfrom = move_to(m); // HACK: See comment at beginning of function
1380 // Find destination squares for king and rook
1381 if (rfrom > kfrom) // O-O
1383 kto = relative_square(us, SQ_G1);
1384 rto = relative_square(us, SQ_F1);
1386 kto = relative_square(us, SQ_C1);
1387 rto = relative_square(us, SQ_D1);
1390 assert(piece_on(kto) == make_piece(us, KING));
1391 assert(piece_on(rto) == make_piece(us, ROOK));
1393 // Remove pieces from destination squares:
1394 clear_bit(&(byColorBB[us]), kto);
1395 clear_bit(&(byTypeBB[KING]), kto);
1396 clear_bit(&(byTypeBB[0]), kto); // HACK: byTypeBB[0] == occupied squares
1397 clear_bit(&(byColorBB[us]), rto);
1398 clear_bit(&(byTypeBB[ROOK]), rto);
1399 clear_bit(&(byTypeBB[0]), rto); // HACK: byTypeBB[0] == occupied squares
1401 // Put pieces on source squares:
1402 set_bit(&(byColorBB[us]), kfrom);
1403 set_bit(&(byTypeBB[KING]), kfrom);
1404 set_bit(&(byTypeBB[0]), kfrom); // HACK: byTypeBB[0] == occupied squares
1405 set_bit(&(byColorBB[us]), rfrom);
1406 set_bit(&(byTypeBB[ROOK]), rfrom);
1407 set_bit(&(byTypeBB[0]), rfrom); // HACK: byTypeBB[0] == occupied squares
1410 board[rto] = board[kto] = PIECE_NONE;
1411 board[rfrom] = make_piece(us, ROOK);
1412 board[kfrom] = make_piece(us, KING);
1414 // Update piece lists
1415 pieceList[us][KING][index[kto]] = kfrom;
1416 pieceList[us][ROOK][index[rto]] = rfrom;
1417 int tmp = index[rto]; // In Chess960 could be rto == kfrom
1418 index[kfrom] = index[kto];
1421 // Finally point our state pointer back to the previous state
1428 /// Position::do_null_move makes() a "null move": It switches the side to move
1429 /// and updates the hash key without executing any move on the board.
1431 void Position::do_null_move(StateInfo& backupSt) {
1434 assert(!in_check());
1436 // Back up the information necessary to undo the null move to the supplied
1437 // StateInfo object.
1438 // Note that differently from normal case here backupSt is actually used as
1439 // a backup storage not as a new state to be used.
1440 backupSt.key = st->key;
1441 backupSt.epSquare = st->epSquare;
1442 backupSt.value = st->value;
1443 backupSt.previous = st->previous;
1444 backupSt.pliesFromNull = st->pliesFromNull;
1445 st->previous = &backupSt;
1447 // Save the current key to the history[] array, in order to be able to
1448 // detect repetition draws.
1449 history[st->gamePly++] = st->key;
1451 // Update the necessary information
1452 if (st->epSquare != SQ_NONE)
1453 st->key ^= zobEp[st->epSquare];
1455 st->key ^= zobSideToMove;
1456 prefetch((char*)TT.first_entry(st->key));
1458 sideToMove = opposite_color(sideToMove);
1459 st->epSquare = SQ_NONE;
1461 st->pliesFromNull = 0;
1462 st->value += (sideToMove == WHITE) ? TempoValue : -TempoValue;
1466 /// Position::undo_null_move() unmakes a "null move".
1468 void Position::undo_null_move() {
1471 assert(!in_check());
1473 // Restore information from the our backup StateInfo object
1474 StateInfo* backupSt = st->previous;
1475 st->key = backupSt->key;
1476 st->epSquare = backupSt->epSquare;
1477 st->value = backupSt->value;
1478 st->previous = backupSt->previous;
1479 st->pliesFromNull = backupSt->pliesFromNull;
1481 // Update the necessary information
1482 sideToMove = opposite_color(sideToMove);
1488 /// Position::see() is a static exchange evaluator: It tries to estimate the
1489 /// material gain or loss resulting from a move. There are three versions of
1490 /// this function: One which takes a destination square as input, one takes a
1491 /// move, and one which takes a 'from' and a 'to' square. The function does
1492 /// not yet understand promotions captures.
1494 int Position::see_sign(Move m) const {
1496 assert(move_is_ok(m));
1498 Square from = move_from(m);
1499 Square to = move_to(m);
1501 // Early return if SEE cannot be negative because captured piece value
1502 // is not less then capturing one. Note that king moves always return
1503 // here because king midgame value is set to 0.
1504 if (midgame_value_of_piece_on(to) >= midgame_value_of_piece_on(from))
1510 int Position::see(Move m) const {
1513 Bitboard occupied, attackers, stmAttackers, b;
1514 int swapList[32], slIndex = 1;
1515 PieceType capturedType, pt;
1518 assert(move_is_ok(m));
1520 // As castle moves are implemented as capturing the rook, they have
1521 // SEE == RookValueMidgame most of the times (unless the rook is under
1523 if (move_is_castle(m))
1526 from = move_from(m);
1528 capturedType = type_of_piece_on(to);
1529 occupied = occupied_squares();
1531 // Handle en passant moves
1532 if (st->epSquare == to && type_of_piece_on(from) == PAWN)
1534 Square capQq = (side_to_move() == WHITE ? to - DELTA_N : to - DELTA_S);
1536 assert(capturedType == PIECE_TYPE_NONE);
1537 assert(type_of_piece_on(capQq) == PAWN);
1539 // Remove the captured pawn
1540 clear_bit(&occupied, capQq);
1541 capturedType = PAWN;
1544 // Find all attackers to the destination square, with the moving piece
1545 // removed, but possibly an X-ray attacker added behind it.
1546 clear_bit(&occupied, from);
1547 attackers = (rook_attacks_bb(to, occupied) & pieces(ROOK, QUEEN))
1548 | (bishop_attacks_bb(to, occupied)& pieces(BISHOP, QUEEN))
1549 | (attacks_from<KNIGHT>(to) & pieces(KNIGHT))
1550 | (attacks_from<KING>(to) & pieces(KING))
1551 | (attacks_from<PAWN>(to, WHITE) & pieces(PAWN, BLACK))
1552 | (attacks_from<PAWN>(to, BLACK) & pieces(PAWN, WHITE));
1554 // If the opponent has no attackers we are finished
1555 stm = opposite_color(color_of_piece_on(from));
1556 stmAttackers = attackers & pieces_of_color(stm);
1558 return seeValues[capturedType];
1560 // The destination square is defended, which makes things rather more
1561 // difficult to compute. We proceed by building up a "swap list" containing
1562 // the material gain or loss at each stop in a sequence of captures to the
1563 // destination square, where the sides alternately capture, and always
1564 // capture with the least valuable piece. After each capture, we look for
1565 // new X-ray attacks from behind the capturing piece.
1566 swapList[0] = seeValues[capturedType];
1567 capturedType = type_of_piece_on(from);
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(pt)); pt++)
1576 // Remove the attacker we just found from the 'occupied' bitboard,
1577 // and scan for new X-ray attacks behind the attacker.
1578 b = stmAttackers & pieces(pt);
1579 occupied ^= (b & (~b + 1));
1580 attackers |= (rook_attacks_bb(to, occupied) & pieces(ROOK, QUEEN))
1581 | (bishop_attacks_bb(to, occupied) & pieces(BISHOP, QUEEN));
1583 attackers &= occupied; // Cut out pieces we've already done
1585 // Add the new entry to the swap list
1586 assert(slIndex < 32);
1587 swapList[slIndex] = -swapList[slIndex - 1] + seeValues[capturedType];
1590 // Remember the value of the capturing piece, and change the side to
1591 // move before beginning the next iteration.
1593 stm = opposite_color(stm);
1594 stmAttackers = attackers & pieces_of_color(stm);
1596 // Stop before processing a king capture
1597 if (capturedType == KING && stmAttackers)
1599 assert(slIndex < 32);
1600 swapList[slIndex++] = 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[slIndex-1] = Min(-swapList[slIndex], swapList[slIndex-1]);
1614 /// Position::clear() erases the position object to a pristine state, with an
1615 /// empty board, white to move, and no castling rights.
1617 void Position::clear() {
1620 memset(st, 0, sizeof(StateInfo));
1621 st->epSquare = SQ_NONE;
1622 startPosPlyCounter = 0;
1625 memset(byColorBB, 0, sizeof(Bitboard) * 2);
1626 memset(byTypeBB, 0, sizeof(Bitboard) * 8);
1627 memset(pieceCount, 0, sizeof(int) * 2 * 8);
1628 memset(index, 0, sizeof(int) * 64);
1630 for (int i = 0; i < 64; i++)
1631 board[i] = PIECE_NONE;
1633 for (int i = 0; i < 8; i++)
1634 for (int j = 0; j < 16; j++)
1635 pieceList[0][i][j] = pieceList[1][i][j] = SQ_NONE;
1637 for (Square sq = SQ_A1; sq <= SQ_H8; sq++)
1638 castleRightsMask[sq] = ALL_CASTLES;
1641 initialKFile = FILE_E;
1642 initialKRFile = FILE_H;
1643 initialQRFile = FILE_A;
1647 /// Position::put_piece() puts a piece on the given square of the board,
1648 /// updating the board array, pieces list, bitboards, and piece counts.
1650 void Position::put_piece(Piece p, Square s) {
1652 Color c = color_of_piece(p);
1653 PieceType pt = type_of_piece(p);
1656 index[s] = pieceCount[c][pt]++;
1657 pieceList[c][pt][index[s]] = s;
1659 set_bit(&(byTypeBB[pt]), s);
1660 set_bit(&(byColorBB[c]), s);
1661 set_bit(&(byTypeBB[0]), s); // HACK: byTypeBB[0] contains all occupied squares.
1665 /// Position::compute_key() computes the hash key of the position. The hash
1666 /// key is usually updated incrementally as moves are made and unmade, the
1667 /// compute_key() function is only used when a new position is set up, and
1668 /// to verify the correctness of the hash key when running in debug mode.
1670 Key Position::compute_key() const {
1672 Key result = zobCastle[st->castleRights];
1674 for (Square s = SQ_A1; s <= SQ_H8; s++)
1675 if (square_is_occupied(s))
1676 result ^= zobrist[color_of_piece_on(s)][type_of_piece_on(s)][s];
1678 if (ep_square() != SQ_NONE)
1679 result ^= zobEp[ep_square()];
1681 if (side_to_move() == BLACK)
1682 result ^= zobSideToMove;
1688 /// Position::compute_pawn_key() computes the hash key of the position. The
1689 /// hash key is usually updated incrementally as moves are made and unmade,
1690 /// the compute_pawn_key() function is only used when a new position is set
1691 /// up, and to verify the correctness of the pawn hash key when running in
1694 Key Position::compute_pawn_key() const {
1699 for (Color c = WHITE; c <= BLACK; c++)
1701 b = pieces(PAWN, c);
1703 result ^= zobrist[c][PAWN][pop_1st_bit(&b)];
1709 /// Position::compute_material_key() computes the hash key of the position.
1710 /// The hash key is usually updated incrementally as moves are made and unmade,
1711 /// the compute_material_key() function is only used when a new position is set
1712 /// up, and to verify the correctness of the material hash key when running in
1715 Key Position::compute_material_key() const {
1720 for (Color c = WHITE; c <= BLACK; c++)
1721 for (PieceType pt = PAWN; pt <= QUEEN; pt++)
1723 count = piece_count(c, pt);
1724 for (int i = 0; i < count; i++)
1725 result ^= zobrist[c][pt][i];
1731 /// Position::compute_value() compute the incremental scores for the middle
1732 /// game and the endgame. These functions are used to initialize the incremental
1733 /// scores when a new position is set up, and to verify that the scores are correctly
1734 /// updated by do_move and undo_move when the program is running in debug mode.
1735 Score Position::compute_value() const {
1738 Score result = SCORE_ZERO;
1740 for (Color c = WHITE; c <= BLACK; c++)
1741 for (PieceType pt = PAWN; pt <= KING; pt++)
1745 result += pst(c, pt, pop_1st_bit(&b));
1748 result += (side_to_move() == WHITE ? TempoValue / 2 : -TempoValue / 2);
1753 /// Position::compute_non_pawn_material() computes the total non-pawn middle
1754 /// game material value for the given side. Material values are updated
1755 /// incrementally during the search, this function is only used while
1756 /// initializing a new Position object.
1758 Value Position::compute_non_pawn_material(Color c) const {
1760 Value result = VALUE_ZERO;
1762 for (PieceType pt = KNIGHT; pt <= QUEEN; pt++)
1763 result += piece_count(c, pt) * PieceValueMidgame[pt];
1769 /// Position::is_draw() tests whether the position is drawn by material,
1770 /// repetition, or the 50 moves rule. It does not detect stalemates, this
1771 /// must be done by the search.
1773 bool Position::is_draw() const {
1775 // Draw by material?
1777 && (non_pawn_material(WHITE) + non_pawn_material(BLACK) <= BishopValueMidgame))
1780 // Draw by the 50 moves rule?
1781 if (st->rule50 > 99 && !is_mate())
1784 // Draw by repetition?
1785 for (int i = 4, e = Min(Min(st->gamePly, st->rule50), st->pliesFromNull); i <= e; i += 2)
1786 if (history[st->gamePly - i] == st->key)
1793 /// Position::is_mate() returns true or false depending on whether the
1794 /// side to move is checkmated.
1796 bool Position::is_mate() const {
1798 MoveStack moves[MAX_MOVES];
1799 return in_check() && generate<MV_LEGAL>(*this, moves) == moves;
1803 /// Position::init_zobrist() is a static member function which initializes at
1804 /// startup the various arrays used to compute hash keys.
1806 void Position::init_zobrist() {
1811 for (i = 0; i < 2; i++) for (j = 0; j < 8; j++) for (k = 0; k < 64; k++)
1812 zobrist[i][j][k] = rk.rand<Key>();
1814 for (i = 0; i < 64; i++)
1815 zobEp[i] = rk.rand<Key>();
1817 for (i = 0; i < 16; i++)
1818 zobCastle[i] = rk.rand<Key>();
1820 zobSideToMove = rk.rand<Key>();
1821 zobExclusion = rk.rand<Key>();
1825 /// Position::init_piece_square_tables() initializes the piece square tables.
1826 /// This is a two-step operation: First, the white halves of the tables are
1827 /// copied from the MgPST[][] and EgPST[][] arrays. Second, the black halves
1828 /// of the tables are initialized by mirroring and changing the sign of the
1829 /// corresponding white scores.
1831 void Position::init_piece_square_tables() {
1833 for (Square s = SQ_A1; s <= SQ_H8; s++)
1834 for (Piece p = WP; p <= WK; p++)
1835 PieceSquareTable[p][s] = make_score(MgPST[p][s], EgPST[p][s]);
1837 for (Square s = SQ_A1; s <= SQ_H8; s++)
1838 for (Piece p = BP; p <= BK; p++)
1839 PieceSquareTable[p][s] = -PieceSquareTable[p-8][flip_square(s)];
1843 /// Position::flip() flips position with the white and black sides reversed. This
1844 /// is only useful for debugging especially for finding evaluation symmetry bugs.
1846 void Position::flip() {
1850 // Make a copy of current position before to start changing
1851 const Position pos(*this, threadID);
1854 threadID = pos.thread();
1857 for (Square s = SQ_A1; s <= SQ_H8; s++)
1858 if (!pos.square_is_empty(s))
1859 put_piece(Piece(pos.piece_on(s) ^ 8), flip_square(s));
1862 sideToMove = opposite_color(pos.side_to_move());
1865 if (pos.can_castle_kingside(WHITE)) do_allow_oo(BLACK);
1866 if (pos.can_castle_queenside(WHITE)) do_allow_ooo(BLACK);
1867 if (pos.can_castle_kingside(BLACK)) do_allow_oo(WHITE);
1868 if (pos.can_castle_queenside(BLACK)) do_allow_ooo(WHITE);
1870 initialKFile = pos.initialKFile;
1871 initialKRFile = pos.initialKRFile;
1872 initialQRFile = pos.initialQRFile;
1874 castleRightsMask[make_square(initialKFile, RANK_1)] ^= (WHITE_OO | WHITE_OOO);
1875 castleRightsMask[make_square(initialKFile, RANK_8)] ^= (BLACK_OO | BLACK_OOO);
1876 castleRightsMask[make_square(initialKRFile, RANK_1)] ^= WHITE_OO;
1877 castleRightsMask[make_square(initialKRFile, RANK_8)] ^= BLACK_OO;
1878 castleRightsMask[make_square(initialQRFile, RANK_1)] ^= WHITE_OOO;
1879 castleRightsMask[make_square(initialQRFile, RANK_8)] ^= BLACK_OOO;
1881 // En passant square
1882 if (pos.st->epSquare != SQ_NONE)
1883 st->epSquare = flip_square(pos.st->epSquare);
1889 st->key = compute_key();
1890 st->pawnKey = compute_pawn_key();
1891 st->materialKey = compute_material_key();
1893 // Incremental scores
1894 st->value = compute_value();
1897 st->npMaterial[WHITE] = compute_non_pawn_material(WHITE);
1898 st->npMaterial[BLACK] = compute_non_pawn_material(BLACK);
1904 /// Position::is_ok() performs some consitency checks for the position object.
1905 /// This is meant to be helpful when debugging.
1907 bool Position::is_ok(int* failedStep) const {
1909 // What features of the position should be verified?
1910 const bool debugAll = false;
1912 const bool debugBitboards = debugAll || false;
1913 const bool debugKingCount = debugAll || false;
1914 const bool debugKingCapture = debugAll || false;
1915 const bool debugCheckerCount = debugAll || false;
1916 const bool debugKey = debugAll || false;
1917 const bool debugMaterialKey = debugAll || false;
1918 const bool debugPawnKey = debugAll || false;
1919 const bool debugIncrementalEval = debugAll || false;
1920 const bool debugNonPawnMaterial = debugAll || false;
1921 const bool debugPieceCounts = debugAll || false;
1922 const bool debugPieceList = debugAll || false;
1923 const bool debugCastleSquares = debugAll || false;
1925 if (failedStep) *failedStep = 1;
1928 if (!color_is_ok(side_to_move()))
1931 // Are the king squares in the position correct?
1932 if (failedStep) (*failedStep)++;
1933 if (piece_on(king_square(WHITE)) != WK)
1936 if (failedStep) (*failedStep)++;
1937 if (piece_on(king_square(BLACK)) != BK)
1941 if (failedStep) (*failedStep)++;
1942 if (!file_is_ok(initialKRFile))
1945 if (!file_is_ok(initialQRFile))
1948 // Do both sides have exactly one king?
1949 if (failedStep) (*failedStep)++;
1952 int kingCount[2] = {0, 0};
1953 for (Square s = SQ_A1; s <= SQ_H8; s++)
1954 if (type_of_piece_on(s) == KING)
1955 kingCount[color_of_piece_on(s)]++;
1957 if (kingCount[0] != 1 || kingCount[1] != 1)
1961 // Can the side to move capture the opponent's king?
1962 if (failedStep) (*failedStep)++;
1963 if (debugKingCapture)
1965 Color us = side_to_move();
1966 Color them = opposite_color(us);
1967 Square ksq = king_square(them);
1968 if (attackers_to(ksq) & pieces_of_color(us))
1972 // Is there more than 2 checkers?
1973 if (failedStep) (*failedStep)++;
1974 if (debugCheckerCount && count_1s<CNT32>(st->checkersBB) > 2)
1978 if (failedStep) (*failedStep)++;
1981 // The intersection of the white and black pieces must be empty
1982 if ((pieces_of_color(WHITE) & pieces_of_color(BLACK)) != EmptyBoardBB)
1985 // The union of the white and black pieces must be equal to all
1987 if ((pieces_of_color(WHITE) | pieces_of_color(BLACK)) != occupied_squares())
1990 // Separate piece type bitboards must have empty intersections
1991 for (PieceType p1 = PAWN; p1 <= KING; p1++)
1992 for (PieceType p2 = PAWN; p2 <= KING; p2++)
1993 if (p1 != p2 && (pieces(p1) & pieces(p2)))
1997 // En passant square OK?
1998 if (failedStep) (*failedStep)++;
1999 if (ep_square() != SQ_NONE)
2001 // The en passant square must be on rank 6, from the point of view of the
2003 if (relative_rank(side_to_move(), ep_square()) != RANK_6)
2008 if (failedStep) (*failedStep)++;
2009 if (debugKey && st->key != compute_key())
2012 // Pawn hash key OK?
2013 if (failedStep) (*failedStep)++;
2014 if (debugPawnKey && st->pawnKey != compute_pawn_key())
2017 // Material hash key OK?
2018 if (failedStep) (*failedStep)++;
2019 if (debugMaterialKey && st->materialKey != compute_material_key())
2022 // Incremental eval OK?
2023 if (failedStep) (*failedStep)++;
2024 if (debugIncrementalEval && st->value != compute_value())
2027 // Non-pawn material OK?
2028 if (failedStep) (*failedStep)++;
2029 if (debugNonPawnMaterial)
2031 if (st->npMaterial[WHITE] != compute_non_pawn_material(WHITE))
2034 if (st->npMaterial[BLACK] != compute_non_pawn_material(BLACK))
2039 if (failedStep) (*failedStep)++;
2040 if (debugPieceCounts)
2041 for (Color c = WHITE; c <= BLACK; c++)
2042 for (PieceType pt = PAWN; pt <= KING; pt++)
2043 if (pieceCount[c][pt] != count_1s<CNT32>(pieces(pt, c)))
2046 if (failedStep) (*failedStep)++;
2048 for (Color c = WHITE; c <= BLACK; c++)
2049 for (PieceType pt = PAWN; pt <= KING; pt++)
2050 for (int i = 0; i < pieceCount[c][pt]; i++)
2052 if (piece_on(piece_list(c, pt, i)) != make_piece(c, pt))
2055 if (index[piece_list(c, pt, i)] != i)
2059 if (failedStep) (*failedStep)++;
2060 if (debugCastleSquares)
2062 for (Color c = WHITE; c <= BLACK; c++)
2064 if (can_castle_kingside(c) && piece_on(initial_kr_square(c)) != make_piece(c, ROOK))
2067 if (can_castle_queenside(c) && piece_on(initial_qr_square(c)) != make_piece(c, ROOK))
2070 if (castleRightsMask[initial_kr_square(WHITE)] != (ALL_CASTLES ^ WHITE_OO))
2072 if (castleRightsMask[initial_qr_square(WHITE)] != (ALL_CASTLES ^ WHITE_OOO))
2074 if (castleRightsMask[initial_kr_square(BLACK)] != (ALL_CASTLES ^ BLACK_OO))
2076 if (castleRightsMask[initial_qr_square(BLACK)] != (ALL_CASTLES ^ BLACK_OOO))
2080 if (failedStep) *failedStep = 0;