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 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/>.
21 #if !defined(POSITION_H_INCLUDED)
22 #define POSITION_H_INCLUDED
24 // Disable a silly and noisy warning from MSVC compiler
27 // Forcing value to bool 'true' or 'false' (performance warning)
28 #pragma warning(disable: 4800)
38 #include "direction.h"
50 /// FEN string for the initial position:
51 const std::string StartPosition =
52 "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
54 /// Maximum number of plies per game (220 should be enough, because the
55 /// maximum search depth is 100, and during position setup we reset the
56 /// move counter for every non-reversible move):
57 const int MaxGameLength = 220;
64 /// Castle rights, encoded as bit fields:
76 /// The UndoInfo struct stores information we need to restore a Position
77 /// object to its previous state when we retract a move. Whenever a move
78 /// is made on the board (by calling Position::do_move), an UndoInfo object
79 /// must be passed as a parameter. When the move is unmade (by calling
80 /// Position::undo_move), the same UndoInfo object must be passed again.
86 Key key, pawnKey, materialKey;
90 Value mgValue, egValue;
94 /// The position data structure. A position consists of the following data:
96 /// * For each piece type, a bitboard representing the squares occupied
97 /// by pieces of that type.
98 /// * For each color, a bitboard representing the squares occupiecd by
99 /// pieces of that color.
100 /// * A bitboard of all occupied squares.
101 /// * A bitboard of all checking pieces.
102 /// * A 64-entry array of pieces, indexed by the squares of the board.
103 /// * The current side to move.
104 /// * Information about the castling rights for both sides.
105 /// * The initial files of the kings and both pairs of rooks. This is
106 /// used to implement the Chess960 castling rules.
107 /// * The en passant square (which is SQ_NONE if no en passant capture is
109 /// * The squares of the kings for both sides.
110 /// * The last move played.
111 /// * Hash keys for the position itself, the current pawn structure, and
112 /// the current material situation.
113 /// * Hash keys for all previous positions in the game (for detecting
114 /// repetition draws.
115 /// * A counter for detecting 50 move rule draws.
119 friend class MaterialInfo;
124 Position(const Position &pos);
125 Position(const std::string &fen);
128 void from_fen(const std::string &fen);
129 const std::string to_fen() const;
133 void copy(const Position &pos);
134 void flipped_copy(const Position &pos);
136 // The piece on a given square
137 Piece piece_on(Square s) const;
138 PieceType type_of_piece_on(Square s) const;
139 Color color_of_piece_on(Square s) const;
140 bool square_is_empty(Square s) const;
141 bool square_is_occupied(Square s) const;
142 Value midgame_value_of_piece_on(Square s) const;
143 Value endgame_value_of_piece_on(Square s) const;
146 Color side_to_move() const;
148 // Bitboard representation of the position
149 Bitboard empty_squares() const;
150 Bitboard occupied_squares() const;
151 Bitboard pieces_of_color(Color c) const;
152 Bitboard pieces_of_type(PieceType pt) const;
153 Bitboard pieces_of_color_and_type(Color c, PieceType pt) const;
154 Bitboard pawns() const;
155 Bitboard knights() const;
156 Bitboard bishops() const;
157 Bitboard rooks() const;
158 Bitboard queens() const;
159 Bitboard kings() const;
160 Bitboard rooks_and_queens() const;
161 Bitboard bishops_and_queens() const;
162 Bitboard sliders() const;
163 Bitboard pawns(Color c) const;
164 Bitboard knights(Color c) const;
165 Bitboard bishops(Color c) const;
166 Bitboard rooks(Color c) const;
167 Bitboard queens(Color c) const;
168 Bitboard kings(Color c) const;
169 Bitboard rooks_and_queens(Color c) const;
170 Bitboard bishops_and_queens(Color c) const;
171 Bitboard sliders_of_color(Color c) const;
173 // Number of pieces of each color and type
174 int piece_count(Color c, PieceType pt) const;
176 // The en passant square:
177 Square ep_square() const;
179 // Current king position for each color
180 Square king_square(Color c) const;
183 bool can_castle_kingside(Color c) const;
184 bool can_castle_queenside(Color c) const;
185 bool can_castle(Color c) const;
186 Square initial_kr_square(Color c) const;
187 Square initial_qr_square(Color c) const;
190 Bitboard sliding_attacks(Square s, Direction d) const;
191 Bitboard ray_attacks(Square s, SignedDirection d) const;
192 Bitboard pawn_attacks(Color c, Square s) const;
195 Bitboard piece_attacks(Square s) const;
197 // Bitboards for pinned pieces and discovered check candidates
198 Bitboard discovered_check_candidates(Color c) const;
199 Bitboard pinned_pieces(Color c) const;
202 Bitboard checkers() const;
205 Square piece_list(Color c, PieceType pt, int index) const;
207 // Attack information for a given square
208 bool square_is_attacked(Square s, Color c) const;
209 Bitboard attacks_to(Square s) const;
210 Bitboard attacks_to(Square s, Color c) const;
211 bool is_check() const;
212 bool pawn_attacks_square(Color c, Square f, Square t) const;
215 Bitboard piece_attacks_square(Square f, Square t) const; // Dispatch at compile-time
217 bool piece_attacks_square(Square f, Square t) const; // Dispatch at run-time
219 // Properties of moves
220 bool pl_move_is_legal(Move m) const;
221 bool pl_move_is_legal(Move m, Bitboard pinned) const;
222 bool move_is_check(Move m) const;
223 bool move_is_check(Move m, Bitboard dcCandidates) const;
224 bool move_is_capture(Move m) const;
225 bool move_is_deep_pawn_push(Move m) const;
226 bool move_is_pawn_push_to_7th(Move m) const;
227 bool move_is_passed_pawn_push(Move m) const;
228 bool move_was_passed_pawn_push(Move m) const;
229 bool move_attacks_square(Move m, Square s) const;
231 // Information about pawns
232 bool pawn_is_passed(Color c, Square s) const;
233 bool pawn_is_isolated(Color c, Square s) const;
234 bool pawn_is_doubled(Color c, Square s) const;
236 // Open and half-open files
237 bool file_is_open(File f) const;
238 bool file_is_half_open(Color c, File f) const;
241 bool square_is_weak(Square s, Color c) const;
243 // Doing and undoing moves
244 void backup(UndoInfo &u) const;
245 void restore(const UndoInfo &u);
246 void do_move(Move m, UndoInfo &u);
247 void do_move(Move m, UndoInfo &u, Bitboard dcCandidates);
248 void undo_move(Move m, const UndoInfo &u);
249 void do_null_move(UndoInfo &u);
250 void undo_null_move(const UndoInfo &u);
252 // Static exchange evaluation
253 int see(Square from, Square to) const;
254 int see(Move m) const;
256 // Accessing hash keys
258 Key get_pawn_key() const;
259 Key get_material_key() const;
261 // Incremental evaluation
262 Value mg_value() const;
263 Value eg_value() const;
264 Value non_pawn_material(Color c) const;
265 Phase game_phase() const;
266 Value mg_pst_delta(Move m) const;
268 // Game termination checks
270 bool is_draw() const;
272 // Check if one side threatens a mate in one
273 bool has_mate_threat(Color c);
275 // Number of plies since the last non-reversible move
276 int rule_50_counter() const;
278 // Other properties of the position
279 bool opposite_colored_bishops() const;
280 bool has_pawn_on_7th(Color c) const;
282 // Reset the gamePly variable to 0
283 void reset_game_ply();
285 // Position consistency check, for debugging
286 bool is_ok(int* failedStep = NULL) const;
288 // Static member functions:
289 static void init_zobrist();
290 static void init_piece_square_tables();
293 // Initialization helper functions (used while setting up a position)
295 void put_piece(Piece p, Square s);
296 void allow_oo(Color c);
297 void allow_ooo(Color c);
299 // Helper functions for doing and undoing moves
300 void do_capture_move(Move m, PieceType capture, Color them, Square to);
301 void do_castle_move(Move m);
302 void do_promotion_move(Move m, UndoInfo &u);
303 void do_ep_move(Move m);
304 void undo_castle_move(Move m);
305 void undo_promotion_move(Move m, const UndoInfo &u);
306 void undo_ep_move(Move m);
307 void find_checkers();
309 template<PieceType Piece, bool FindPinned>
310 Bitboard hidden_checks(Color c, Square ksq) const;
312 // Computing hash keys from scratch (for initialization and debugging)
313 Key compute_key() const;
314 Key compute_pawn_key() const;
315 Key compute_material_key() const;
317 // Computing incremental evaluation scores and material counts
318 Value mg_pst(Color c, PieceType pt, Square s) const;
319 Value eg_pst(Color c, PieceType pt, Square s) const;
320 Value compute_mg_value() const;
321 Value compute_eg_value() const;
322 Value compute_non_pawn_material(Color c) const;
325 Bitboard byColorBB[2], byTypeBB[8];
332 int pieceCount[2][8]; // [color][pieceType]
335 Square pieceList[2][8][16]; // [color][pieceType][index]
341 File initialKFile, initialKRFile, initialQRFile;
343 Square kingSquare[2];
345 Key key, pawnKey, materialKey, history[MaxGameLength];
347 Value mgValue, egValue;
351 static int castleRightsMask[64];
352 static Key zobrist[2][8][64];
353 static Key zobEp[64];
354 static Key zobCastle[16];
355 static Key zobMaterial[2][8][16];
356 static Key zobSideToMove;
357 static Value MgPieceSquareTable[16][64];
358 static Value EgPieceSquareTable[16][64];
363 //// Inline functions
366 inline Piece Position::piece_on(Square s) const {
370 inline Color Position::color_of_piece_on(Square s) const {
371 return color_of_piece(piece_on(s));
374 inline PieceType Position::type_of_piece_on(Square s) const {
375 return type_of_piece(piece_on(s));
378 inline bool Position::square_is_empty(Square s) const {
379 return piece_on(s) == EMPTY;
382 inline bool Position::square_is_occupied(Square s) const {
383 return !square_is_empty(s);
386 inline Value Position::midgame_value_of_piece_on(Square s) const {
387 return piece_value_midgame(piece_on(s));
390 inline Value Position::endgame_value_of_piece_on(Square s) const {
391 return piece_value_endgame(piece_on(s));
394 inline Color Position::side_to_move() const {
398 inline Bitboard Position::occupied_squares() const {
402 inline Bitboard Position::empty_squares() const {
403 return ~(occupied_squares());
406 inline Bitboard Position::pieces_of_color(Color c) const {
410 inline Bitboard Position::pieces_of_type(PieceType pt) const {
414 inline Bitboard Position::pieces_of_color_and_type(Color c, PieceType pt) const {
415 return pieces_of_color(c) & pieces_of_type(pt);
418 inline Bitboard Position::pawns() const {
419 return pieces_of_type(PAWN);
422 inline Bitboard Position::knights() const {
423 return pieces_of_type(KNIGHT);
426 inline Bitboard Position::bishops() const {
427 return pieces_of_type(BISHOP);
430 inline Bitboard Position::rooks() const {
431 return pieces_of_type(ROOK);
434 inline Bitboard Position::queens() const {
435 return pieces_of_type(QUEEN);
438 inline Bitboard Position::kings() const {
439 return pieces_of_type(KING);
442 inline Bitboard Position::rooks_and_queens() const {
443 return rooks() | queens();
446 inline Bitboard Position::bishops_and_queens() const {
447 return bishops() | queens();
450 inline Bitboard Position::sliders() const {
451 return bishops() | queens() | rooks();
454 inline Bitboard Position::pawns(Color c) const {
455 return pieces_of_color_and_type(c, PAWN);
458 inline Bitboard Position::knights(Color c) const {
459 return pieces_of_color_and_type(c, KNIGHT);
462 inline Bitboard Position::bishops(Color c) const {
463 return pieces_of_color_and_type(c, BISHOP);
466 inline Bitboard Position::rooks(Color c) const {
467 return pieces_of_color_and_type(c, ROOK);
470 inline Bitboard Position::queens(Color c) const {
471 return pieces_of_color_and_type(c, QUEEN);
474 inline Bitboard Position::kings(Color c) const {
475 return pieces_of_color_and_type(c, KING);
478 inline Bitboard Position::rooks_and_queens(Color c) const {
479 return rooks_and_queens() & pieces_of_color(c);
482 inline Bitboard Position::bishops_and_queens(Color c) const {
483 return bishops_and_queens() & pieces_of_color(c);
486 inline Bitboard Position::sliders_of_color(Color c) const {
487 return sliders() & pieces_of_color(c);
490 inline int Position::piece_count(Color c, PieceType pt) const {
491 return pieceCount[c][pt];
494 inline Square Position::piece_list(Color c, PieceType pt, int index) const {
495 return pieceList[c][pt][index];
498 inline Square Position::ep_square() const {
502 inline Square Position::king_square(Color c) const {
503 return kingSquare[c];
506 inline bool Position::can_castle_kingside(Color side) const {
507 return castleRights & (1+int(side));
510 inline bool Position::can_castle_queenside(Color side) const {
511 return castleRights & (4+4*int(side));
514 inline bool Position::can_castle(Color side) const {
515 return can_castle_kingside(side) || can_castle_queenside(side);
518 inline Square Position::initial_kr_square(Color c) const {
519 return relative_square(c, make_square(initialKRFile, RANK_1));
522 inline Square Position::initial_qr_square(Color c) const {
523 return relative_square(c, make_square(initialQRFile, RANK_1));
526 inline Bitboard Position::pawn_attacks(Color c, Square s) const {
527 return StepAttackBB[pawn_of_color(c)][s];
531 inline Bitboard Position::piece_attacks<KNIGHT>(Square s) const {
532 return StepAttackBB[KNIGHT][s];
536 inline Bitboard Position::piece_attacks<BISHOP>(Square s) const {
537 return bishop_attacks_bb(s, occupied_squares());
541 inline Bitboard Position::piece_attacks<ROOK>(Square s) const {
542 return rook_attacks_bb(s, occupied_squares());
546 inline Bitboard Position::piece_attacks<QUEEN>(Square s) const {
547 return piece_attacks<ROOK>(s) | piece_attacks<BISHOP>(s);
551 inline Bitboard Position::piece_attacks<KING>(Square s) const {
552 return StepAttackBB[KING][s];
555 inline Bitboard Position::checkers() const {
559 inline bool Position::is_check() const {
560 return checkersBB != EmptyBoardBB;
563 inline bool Position::pawn_attacks_square(Color c, Square f, Square t) const {
564 return bit_is_set(pawn_attacks(c, f), t);
567 template<PieceType Piece>
568 Bitboard Position::piece_attacks_square(Square f, Square t) const {
569 return bit_is_set(piece_attacks<Piece>(f), t);
572 inline bool Position::pawn_is_passed(Color c, Square s) const {
573 return !(pawns(opposite_color(c)) & passed_pawn_mask(c, s));
576 inline bool Position::pawn_is_isolated(Color c, Square s) const {
577 return !(pawns(c) & neighboring_files_bb(s));
580 inline bool Position::pawn_is_doubled(Color c, Square s) const {
581 return pawns(c) & squares_behind(c, s);
584 inline bool Position::file_is_open(File f) const {
585 return !(pawns() & file_bb(f));
588 inline bool Position::file_is_half_open(Color c, File f) const {
589 return !(pawns(c) & file_bb(f));
592 inline bool Position::square_is_weak(Square s, Color c) const {
593 return !(pawns(c) & outpost_mask(opposite_color(c), s));
596 inline Key Position::get_key() const {
600 inline Key Position::get_pawn_key() const {
604 inline Key Position::get_material_key() const {
608 inline Value Position::mg_pst(Color c, PieceType pt, Square s) const {
609 return MgPieceSquareTable[piece_of_color_and_type(c, pt)][s];
612 inline Value Position::mg_pst_delta(Move m) const {
613 return MgPieceSquareTable[piece_on(move_from(m))][move_to(m)]
614 -MgPieceSquareTable[piece_on(move_from(m))][move_from(m)];
617 inline Value Position::eg_pst(Color c, PieceType pt, Square s) const {
618 return EgPieceSquareTable[piece_of_color_and_type(c, pt)][s];
621 inline Value Position::mg_value() const {
625 inline Value Position::eg_value() const {
629 inline Value Position::non_pawn_material(Color c) const {
630 return npMaterial[c];
633 inline Phase Position::game_phase() const {
635 // The purpose of the Value(325) terms below is to make sure the difference
636 // between MidgameLimit and EndgameLimit is a power of 2, which should make
637 // the division at the end of the function a bit faster.
638 static const Value MidgameLimit = 2 * QueenValueMidgame
639 + 2 * RookValueMidgame
640 + 6 * BishopValueMidgame
643 static const Value EndgameLimit = 4 * RookValueMidgame - Value(325);
645 Value npm = non_pawn_material(WHITE) + non_pawn_material(BLACK);
647 if (npm >= MidgameLimit)
648 return PHASE_MIDGAME;
649 else if(npm <= EndgameLimit)
650 return PHASE_ENDGAME;
652 return Phase(((npm - EndgameLimit) * 128) / (MidgameLimit - EndgameLimit));
655 inline bool Position::move_is_deep_pawn_push(Move m) const {
657 Color c = side_to_move();
658 return piece_on(move_from(m)) == pawn_of_color(c)
659 && relative_rank(c, move_to(m)) > RANK_4;
662 inline bool Position::move_is_pawn_push_to_7th(Move m) const {
664 Color c = side_to_move();
665 return piece_on(move_from(m)) == pawn_of_color(c)
666 && relative_rank(c, move_to(m)) == RANK_7;
669 inline bool Position::move_is_passed_pawn_push(Move m) const {
671 Color c = side_to_move();
672 return piece_on(move_from(m)) == pawn_of_color(c)
673 && pawn_is_passed(c, move_to(m));
676 inline bool Position::move_was_passed_pawn_push(Move m) const {
678 Color c = opposite_color(side_to_move());
679 return piece_on(move_to(m)) == pawn_of_color(c)
680 && pawn_is_passed(c, move_to(m));
683 inline int Position::rule_50_counter() const {
688 inline bool Position::opposite_colored_bishops() const {
690 return piece_count(WHITE, BISHOP) == 1
691 && piece_count(BLACK, BISHOP) == 1
692 && square_color(piece_list(WHITE, BISHOP, 0)) != square_color(piece_list(BLACK, BISHOP, 0));
695 inline bool Position::has_pawn_on_7th(Color c) const {
697 return pawns(c) & relative_rank_bb(c, RANK_7);
701 #endif // !defined(POSITION_H_INCLUDED)