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/>.
21 #if !defined(POSITION_H_INCLUDED)
22 #define POSITION_H_INCLUDED
24 // Disable some silly and noisy warning from MSVC compiler
27 // Forcing value to bool 'true' or 'false' (performance warning)
28 #pragma warning(disable: 4800)
30 // Conditional expression is constant
31 #pragma warning(disable: 4127)
42 #include "direction.h"
53 /// FEN string for the initial position
54 const std::string StartPosition = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
56 /// Maximum number of plies per game (220 should be enough, because the
57 /// maximum search depth is 100, and during position setup we reset the
58 /// move counter for every non-reversible move).
59 const int MaxGameLength = 220;
66 /// Castle rights, encoded as bit fields
84 /// The StateInfo struct stores information we need to restore a Position
85 /// object to its previous state when we retract a move. Whenever a move
86 /// is made on the board (by calling Position::do_move), an StateInfo object
87 /// must be passed as a parameter.
90 Key key, pawnKey, materialKey;
91 int castleRights, rule50;
93 Value mgValue, egValue;
102 /// The position data structure. A position consists of the following data:
104 /// * For each piece type, a bitboard representing the squares occupied
105 /// by pieces of that type.
106 /// * For each color, a bitboard representing the squares occupied by
107 /// pieces of that color.
108 /// * A bitboard of all occupied squares.
109 /// * A bitboard of all checking pieces.
110 /// * A 64-entry array of pieces, indexed by the squares of the board.
111 /// * The current side to move.
112 /// * Information about the castling rights for both sides.
113 /// * The initial files of the kings and both pairs of rooks. This is
114 /// used to implement the Chess960 castling rules.
115 /// * The en passant square (which is SQ_NONE if no en passant capture is
117 /// * The squares of the kings for both sides.
118 /// * Hash keys for the position itself, the current pawn structure, and
119 /// the current material situation.
120 /// * Hash keys for all previous positions in the game for detecting
121 /// repetition draws.
122 /// * A counter for detecting 50 move rule draws.
126 friend class MaterialInfo;
127 friend class EndgameFunctions;
137 Position(const Position& pos);
138 Position(const std::string& fen);
141 void from_fen(const std::string& fen);
142 const std::string to_fen() const;
143 void print(Move m = MOVE_NONE) const;
146 void copy(const Position& pos);
147 void flipped_copy(const Position& pos);
149 // The piece on a given square
150 Piece piece_on(Square s) const;
151 PieceType type_of_piece_on(Square s) const;
152 Color color_of_piece_on(Square s) const;
153 bool square_is_empty(Square s) const;
154 bool square_is_occupied(Square s) const;
155 Value midgame_value_of_piece_on(Square s) const;
156 Value endgame_value_of_piece_on(Square s) const;
159 Color side_to_move() const;
161 // Bitboard representation of the position
162 Bitboard empty_squares() const;
163 Bitboard occupied_squares() const;
164 Bitboard pieces_of_color(Color c) const;
165 Bitboard pieces_of_type(PieceType pt) const;
166 Bitboard pieces_of_color_and_type(Color c, PieceType pt) const;
167 Bitboard pawns() const;
168 Bitboard knights() const;
169 Bitboard bishops() const;
170 Bitboard rooks() const;
171 Bitboard queens() const;
172 Bitboard kings() const;
173 Bitboard rooks_and_queens() const;
174 Bitboard bishops_and_queens() const;
175 Bitboard sliders() const;
176 Bitboard pawns(Color c) const;
177 Bitboard knights(Color c) const;
178 Bitboard bishops(Color c) const;
179 Bitboard rooks(Color c) const;
180 Bitboard queens(Color c) const;
181 Bitboard kings(Color c) const;
182 Bitboard rooks_and_queens(Color c) const;
183 Bitboard bishops_and_queens(Color c) const;
184 Bitboard sliders_of_color(Color c) const;
186 // Number of pieces of each color and type
187 int piece_count(Color c, PieceType pt) const;
189 // The en passant square
190 Square ep_square() const;
192 // Current king position for each color
193 Square king_square(Color c) const;
196 bool can_castle_kingside(Color c) const;
197 bool can_castle_queenside(Color c) const;
198 bool can_castle(Color c) const;
199 Square initial_kr_square(Color c) const;
200 Square initial_qr_square(Color c) const;
203 Bitboard sliding_attacks(Square s, Direction d) const;
204 Bitboard ray_attacks(Square s, SignedDirection d) const;
205 Bitboard pawn_attacks(Color c, Square s) const;
208 Bitboard piece_attacks(Square s) const;
210 // Bitboards for pinned pieces and discovered check candidates
211 Bitboard discovered_check_candidates(Color c) const;
212 Bitboard pinned_pieces(Color c, Bitboard& p) const;
213 Bitboard pinned_pieces(Color c) const;
216 Bitboard checkers() const;
219 Square piece_list(Color c, PieceType pt, int index) const;
221 // Attack information for a given square
222 bool square_is_attacked(Square s, Color c) const;
223 Bitboard attacks_to(Square s) const;
224 Bitboard attacks_to(Square s, Color c) const;
225 bool is_check() const;
226 bool pawn_attacks_square(Color c, Square f, Square t) const;
229 Bitboard piece_attacks_square(Square f, Square t) const; // Dispatch at compile-time
231 bool piece_attacks_square(Piece p, Square f, Square t) const; // Dispatch at run-time
233 // Properties of moves
234 bool pl_move_is_legal(Move m) const;
235 bool pl_move_is_legal(Move m, Bitboard pinned) const;
236 bool move_is_check(Move m) const;
237 bool move_is_check(Move m, Bitboard dcCandidates) const;
238 bool move_is_capture(Move m) const;
239 bool move_is_deep_pawn_push(Move m) const;
240 bool move_is_pawn_push_to_7th(Move m) const;
241 bool move_is_passed_pawn_push(Move m) const;
242 bool move_was_passed_pawn_push(Move m) const;
243 bool move_attacks_square(Move m, Square s) const;
245 // Information about pawns
246 bool pawn_is_passed(Color c, Square s) const;
247 static bool pawn_is_passed(Bitboard theirPawns, Color c, Square s);
248 static bool pawn_is_isolated(Bitboard ourPawns, Square s);
249 static bool pawn_is_doubled(Bitboard ourPawns, Color c, Square s);
252 bool square_is_weak(Square s, Color c) const;
254 // Doing and undoing moves
256 void do_move(Move m, StateInfo& st);
257 void do_move(Move m, StateInfo& st, Bitboard dcCandidates);
258 void undo_move(Move m);
259 void do_null_move(StateInfo& st);
260 void undo_null_move();
262 // Static exchange evaluation
263 int see(Square from, Square to) const;
264 int see(Move m) const;
265 int see(Square to) const;
266 int see_sign(Move m) const;
268 // Accessing hash keys
270 Key get_pawn_key() const;
271 Key get_material_key() const;
273 // Incremental evaluation
274 Value mg_value() const;
275 Value eg_value() const;
276 Value non_pawn_material(Color c) const;
277 Phase game_phase() const;
278 template<GamePhase> Value pst_delta(Piece piece, Square from, Square to) const;
280 // Game termination checks
281 bool is_mate() const;
282 bool is_draw() const;
284 // Check if one side threatens a mate in one
285 bool has_mate_threat(Color c);
287 // Number of plies since the last non-reversible move
288 int rule_50_counter() const;
290 // Other properties of the position
291 bool opposite_colored_bishops() const;
292 bool has_pawn_on_7th(Color c) const;
294 // Reset the gamePly variable to 0
295 void reset_game_ply();
297 // Position consistency check, for debugging
298 bool is_ok(int* failedStep = NULL) const;
300 // Static member functions:
301 static void init_zobrist();
302 static void init_piece_square_tables();
306 // Initialization helper functions (used while setting up a position)
308 void put_piece(Piece p, Square s);
309 void allow_oo(Color c);
310 void allow_ooo(Color c);
312 // Helper functions for doing and undoing moves
313 void do_capture_move(PieceType capture, Color them, Square to);
314 void do_castle_move(Move m);
315 void do_promotion_move(Move m);
316 void do_ep_move(Move m);
317 void undo_castle_move(Move m);
318 void undo_promotion_move(Move m);
319 void undo_ep_move(Move m);
320 void find_checkers();
322 template<PieceType Piece>
323 void update_checkers(Bitboard* pCheckersBB, Square ksq, Square from, Square to, Bitboard dcCandidates);
325 template<bool FindPinned>
326 Bitboard hidden_checkers(Color c) const;
328 // Computing hash keys from scratch (for initialization and debugging)
329 Key compute_key() const;
330 Key compute_pawn_key() const;
331 Key compute_material_key() const;
333 // Computing incremental evaluation scores and material counts
334 template<GamePhase> Value pst(Color c, PieceType pt, Square s) const;
335 template<GamePhase> Value compute_value() const;
336 Value compute_non_pawn_material(Color c) const;
339 Bitboard byColorBB[2], byTypeBB[8];
345 int pieceCount[2][8]; // [color][pieceType]
348 Square pieceList[2][8][16]; // [color][pieceType][index]
352 Square kingSquare[2];
355 Key history[MaxGameLength];
356 File initialKFile, initialKRFile, initialQRFile;
357 StateInfo startState;
361 static int castleRightsMask[64];
362 static Key zobrist[2][8][64];
363 static Key zobEp[64];
364 static Key zobCastle[16];
365 static Key zobMaterial[2][8][16];
366 static Key zobSideToMove;
367 static Value MgPieceSquareTable[16][64];
368 static Value EgPieceSquareTable[16][64];
373 //// Inline functions
376 inline Piece Position::piece_on(Square s) const {
380 inline Color Position::color_of_piece_on(Square s) const {
381 return color_of_piece(piece_on(s));
384 inline PieceType Position::type_of_piece_on(Square s) const {
385 return type_of_piece(piece_on(s));
388 inline bool Position::square_is_empty(Square s) const {
389 return piece_on(s) == EMPTY;
392 inline bool Position::square_is_occupied(Square s) const {
393 return !square_is_empty(s);
396 inline Value Position::midgame_value_of_piece_on(Square s) const {
397 return piece_value_midgame(piece_on(s));
400 inline Value Position::endgame_value_of_piece_on(Square s) const {
401 return piece_value_endgame(piece_on(s));
404 inline Color Position::side_to_move() const {
408 inline Bitboard Position::occupied_squares() const {
412 inline Bitboard Position::empty_squares() const {
413 return ~(occupied_squares());
416 inline Bitboard Position::pieces_of_color(Color c) const {
420 inline Bitboard Position::pieces_of_type(PieceType pt) const {
424 inline Bitboard Position::pieces_of_color_and_type(Color c, PieceType pt) const {
425 return pieces_of_color(c) & pieces_of_type(pt);
428 inline Bitboard Position::pawns() const {
429 return pieces_of_type(PAWN);
432 inline Bitboard Position::knights() const {
433 return pieces_of_type(KNIGHT);
436 inline Bitboard Position::bishops() const {
437 return pieces_of_type(BISHOP);
440 inline Bitboard Position::rooks() const {
441 return pieces_of_type(ROOK);
444 inline Bitboard Position::queens() const {
445 return pieces_of_type(QUEEN);
448 inline Bitboard Position::kings() const {
449 return pieces_of_type(KING);
452 inline Bitboard Position::rooks_and_queens() const {
453 return rooks() | queens();
456 inline Bitboard Position::bishops_and_queens() const {
457 return bishops() | queens();
460 inline Bitboard Position::sliders() const {
461 return bishops() | queens() | rooks();
464 inline Bitboard Position::pawns(Color c) const {
465 return pieces_of_color_and_type(c, PAWN);
468 inline Bitboard Position::knights(Color c) const {
469 return pieces_of_color_and_type(c, KNIGHT);
472 inline Bitboard Position::bishops(Color c) const {
473 return pieces_of_color_and_type(c, BISHOP);
476 inline Bitboard Position::rooks(Color c) const {
477 return pieces_of_color_and_type(c, ROOK);
480 inline Bitboard Position::queens(Color c) const {
481 return pieces_of_color_and_type(c, QUEEN);
484 inline Bitboard Position::kings(Color c) const {
485 return pieces_of_color_and_type(c, KING);
488 inline Bitboard Position::rooks_and_queens(Color c) const {
489 return rooks_and_queens() & pieces_of_color(c);
492 inline Bitboard Position::bishops_and_queens(Color c) const {
493 return bishops_and_queens() & pieces_of_color(c);
496 inline int Position::piece_count(Color c, PieceType pt) const {
497 return pieceCount[c][pt];
500 inline Square Position::piece_list(Color c, PieceType pt, int index) const {
501 return pieceList[c][pt][index];
504 inline Square Position::ep_square() const {
508 inline Square Position::king_square(Color c) const {
509 return kingSquare[c];
512 inline bool Position::can_castle_kingside(Color side) const {
513 return st->castleRights & (1+int(side));
516 inline bool Position::can_castle_queenside(Color side) const {
517 return st->castleRights & (4+4*int(side));
520 inline bool Position::can_castle(Color side) const {
521 return can_castle_kingside(side) || can_castle_queenside(side);
524 inline Square Position::initial_kr_square(Color c) const {
525 return relative_square(c, make_square(initialKRFile, RANK_1));
528 inline Square Position::initial_qr_square(Color c) const {
529 return relative_square(c, make_square(initialQRFile, RANK_1));
532 inline Bitboard Position::pawn_attacks(Color c, Square s) const {
533 return StepAttackBB[piece_of_color_and_type(c, PAWN)][s];
536 template<PieceType Piece> // Knight and King
537 inline Bitboard Position::piece_attacks(Square s) const {
538 return StepAttackBB[Piece][s];
542 inline Bitboard Position::piece_attacks<PAWN>(Square s) const {
543 return StepAttackBB[piece_of_color_and_type(opposite_color(sideToMove), PAWN)][s];
547 inline Bitboard Position::piece_attacks<BISHOP>(Square s) const {
548 return bishop_attacks_bb(s, occupied_squares());
552 inline Bitboard Position::piece_attacks<ROOK>(Square s) const {
553 return rook_attacks_bb(s, occupied_squares());
557 inline Bitboard Position::piece_attacks<QUEEN>(Square s) const {
558 return piece_attacks<ROOK>(s) | piece_attacks<BISHOP>(s);
561 inline Bitboard Position::checkers() const {
562 return st->checkersBB;
565 inline bool Position::is_check() const {
566 return st->checkersBB != EmptyBoardBB;
569 inline bool Position::pawn_attacks_square(Color c, Square f, Square t) const {
570 return bit_is_set(pawn_attacks(c, f), t);
573 template<PieceType Piece>
574 Bitboard Position::piece_attacks_square(Square f, Square t) const {
575 return bit_is_set(piece_attacks<Piece>(f), t);
578 inline Bitboard Position::attacks_to(Square s, Color c) const {
580 return attacks_to(s) & pieces_of_color(c);
583 inline bool Position::square_is_attacked(Square s, Color c) const {
585 return attacks_to(s, c) != EmptyBoardBB;
588 inline bool Position::pawn_is_passed(Color c, Square s) const {
589 return !(pawns(opposite_color(c)) & passed_pawn_mask(c, s));
592 inline bool Position::pawn_is_passed(Bitboard theirPawns, Color c, Square s) {
593 return !(theirPawns & passed_pawn_mask(c, s));
596 inline bool Position::pawn_is_isolated(Bitboard ourPawns, Square s) {
597 return !(ourPawns & neighboring_files_bb(s));
600 inline bool Position::pawn_is_doubled(Bitboard ourPawns, Color c, Square s) {
601 return ourPawns & squares_behind(c, s);
604 inline bool Position::square_is_weak(Square s, Color c) const {
605 return !(pawns(c) & outpost_mask(opposite_color(c), s));
608 inline Key Position::get_key() const {
612 inline Key Position::get_pawn_key() const {
616 inline Key Position::get_material_key() const {
617 return st->materialKey;
620 template<Position::GamePhase Ph>
621 inline Value Position::pst(Color c, PieceType pt, Square s) const {
622 return (Ph == MidGame ? MgPieceSquareTable[piece_of_color_and_type(c, pt)][s]
623 : EgPieceSquareTable[piece_of_color_and_type(c, pt)][s]);
626 template<Position::GamePhase Ph>
627 inline Value Position::pst_delta(Piece piece, Square from, Square to) const {
628 return (Ph == MidGame ? MgPieceSquareTable[piece][to] - MgPieceSquareTable[piece][from]
629 : EgPieceSquareTable[piece][to] - EgPieceSquareTable[piece][from]);
632 inline Value Position::mg_value() const {
636 inline Value Position::eg_value() const {
640 inline Value Position::non_pawn_material(Color c) const {
641 return st->npMaterial[c];
644 inline Phase Position::game_phase() const {
646 // Values modified by Joona Kiiski
647 static const Value MidgameLimit = Value(15581);
648 static const Value EndgameLimit = Value(3998);
650 Value npm = non_pawn_material(WHITE) + non_pawn_material(BLACK);
652 if (npm >= MidgameLimit)
653 return PHASE_MIDGAME;
654 else if(npm <= EndgameLimit)
655 return PHASE_ENDGAME;
657 return Phase(((npm - EndgameLimit) * 128) / (MidgameLimit - EndgameLimit));
660 inline bool Position::move_is_deep_pawn_push(Move m) const {
662 Color c = side_to_move();
663 return piece_on(move_from(m)) == piece_of_color_and_type(c, PAWN)
664 && relative_rank(c, move_to(m)) > RANK_4;
667 inline bool Position::move_is_pawn_push_to_7th(Move m) const {
669 Color c = side_to_move();
670 return piece_on(move_from(m)) == piece_of_color_and_type(c, PAWN)
671 && relative_rank(c, move_to(m)) == RANK_7;
674 inline bool Position::move_is_passed_pawn_push(Move m) const {
676 Color c = side_to_move();
677 return piece_on(move_from(m)) == piece_of_color_and_type(c, PAWN)
678 && pawn_is_passed(c, move_to(m));
681 inline bool Position::move_was_passed_pawn_push(Move m) const {
683 Color c = opposite_color(side_to_move());
684 return piece_on(move_to(m)) == piece_of_color_and_type(c, PAWN)
685 && pawn_is_passed(c, move_to(m));
688 inline int Position::rule_50_counter() const {
693 inline bool Position::opposite_colored_bishops() const {
695 return piece_count(WHITE, BISHOP) == 1
696 && piece_count(BLACK, BISHOP) == 1
697 && square_color(piece_list(WHITE, BISHOP, 0)) != square_color(piece_list(BLACK, BISHOP, 0));
700 inline bool Position::has_pawn_on_7th(Color c) const {
702 return pawns(c) & relative_rank_bb(c, RANK_7);
705 inline bool Position::move_is_capture(Move m) const {
707 // Move must not be MOVE_NONE !
709 return (!square_is_empty(move_to(m)) && !move_is_castle(m)) || move_is_ep(m);
712 #endif // !defined(POSITION_H_INCLUDED)