X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovegen.cpp;h=98c5419af815c1d45e8b4ed883a089fb1e5397ee;hp=a254590b1286fa8aa02a529d915c377f90c9efe1;hb=94dd204c3b10ebe0e6c8df5d7c98de5ba4906cad;hpb=555d9a8711673fd669be03017f92972f5bc4e839 diff --git a/src/movegen.cpp b/src/movegen.cpp index a254590b..98c5419a 100644 --- a/src/movegen.cpp +++ b/src/movegen.cpp @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -22,54 +22,51 @@ #include "movegen.h" #include "position.h" -/// Simple macro to wrap a very common while loop, no facny, no flexibility, -/// hardcoded names 'mlist' and 'from'. -#define SERIALIZE(b) while (b) (mlist++)->move = make_move(from, pop_lsb(&b)) - -/// Version used for pawns, where the 'from' square is given as a delta from the 'to' square -#define SERIALIZE_PAWNS(b, d) while (b) { Square to = pop_lsb(&b); \ - (mlist++)->move = make_move(to - (d), to); } namespace { - template - ExtMove* generate_castle(const Position& pos, ExtMove* mlist, Color us) { + template + ExtMove* generate_castling(const Position& pos, ExtMove* moveList, Color us, const CheckInfo* ci) { + + static const bool KingSide = (Cr == WHITE_OO || Cr == BLACK_OO); - if (pos.castle_impeded(us, Side) || !pos.can_castle(make_castle_right(us, Side))) - return mlist; + if (pos.castling_impeded(Cr) || !pos.can_castle(Cr)) + return moveList; // After castling, the rook and king final positions are the same in Chess960 // as they would be in standard chess. Square kfrom = pos.king_square(us); - Square rfrom = pos.castle_rook_square(us, Side); - Square kto = relative_square(us, Side == KING_SIDE ? SQ_G1 : SQ_C1); + Square rfrom = pos.castling_rook_square(Cr); + Square kto = relative_square(us, KingSide ? SQ_G1 : SQ_C1); Bitboard enemies = pos.pieces(~us); assert(!pos.checkers()); - const int K = Chess960 ? kto > kfrom ? -1 : 1 - : Side == KING_SIDE ? -1 : 1; + const Square K = Chess960 ? kto > kfrom ? DELTA_W : DELTA_E + : KingSide ? DELTA_W : DELTA_E; - for (Square s = kto; s != kfrom; s += (Square)K) + for (Square s = kto; s != kfrom; s += K) if (pos.attackers_to(s) & enemies) - return mlist; + return moveList; // Because we generate only legal castling moves we need to verify that // when moving the castling rook we do not discover some hidden checker. // For instance an enemy queen in SQ_A1 when castling rook is in SQ_B1. if (Chess960 && (attacks_bb(kto, pos.pieces() ^ rfrom) & pos.pieces(~us, ROOK, QUEEN))) - return mlist; + return moveList; - (mlist++)->move = make(kfrom, rfrom); + Move m = make(kfrom, rfrom); - if (Checks && !pos.gives_check((mlist - 1)->move, CheckInfo(pos))) - --mlist; + if (Checks && !pos.gives_check(m, *ci)) + return moveList; - return mlist; + (moveList++)->move = m; + + return moveList; } template - inline ExtMove* generate_promotions(ExtMove* mlist, Bitboard pawnsOn7, + inline ExtMove* generate_promotions(ExtMove* moveList, Bitboard pawnsOn7, Bitboard target, const CheckInfo* ci) { Bitboard b = shift_bb(pawnsOn7) & target; @@ -79,29 +76,29 @@ namespace { Square to = pop_lsb(&b); if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS) - (mlist++)->move = make(to - Delta, to, QUEEN); + (moveList++)->move = make(to - Delta, to, QUEEN); if (Type == QUIETS || Type == EVASIONS || Type == NON_EVASIONS) { - (mlist++)->move = make(to - Delta, to, ROOK); - (mlist++)->move = make(to - Delta, to, BISHOP); - (mlist++)->move = make(to - Delta, to, KNIGHT); + (moveList++)->move = make(to - Delta, to, ROOK); + (moveList++)->move = make(to - Delta, to, BISHOP); + (moveList++)->move = make(to - Delta, to, KNIGHT); } - // Knight-promotion is the only one that can give a direct check not - // already included in the queen-promotion. + // Knight promotion is the only promotion that can give a direct check + // that's not already included in the queen promotion. if (Type == QUIET_CHECKS && (StepAttacksBB[W_KNIGHT][to] & ci->ksq)) - (mlist++)->move = make(to - Delta, to, KNIGHT); + (moveList++)->move = make(to - Delta, to, KNIGHT); else (void)ci; // Silence a warning under MSVC } - return mlist; + return moveList; } template - ExtMove* generate_pawn_moves(const Position& pos, ExtMove* mlist, + ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard target, const CheckInfo* ci) { // Compute our parametrized parameters at compile time, named according to @@ -144,7 +141,7 @@ namespace { // Add pawn pushes which give discovered check. This is possible only // if the pawn is not on the same file as the enemy king, because we // don't generate captures. Note that a possible discovery check - // promotion has been already generated among captures. + // promotion has been already generated amongst the captures. if (pawnsNotOn7 & ci->dcCandidates) { dc1 = shift_bb(pawnsNotOn7 & ci->dcCandidates) & emptySquares & ~file_bb(ci->ksq); @@ -155,8 +152,17 @@ namespace { } } - SERIALIZE_PAWNS(b1, Up); - SERIALIZE_PAWNS(b2, Up + Up); + while (b1) + { + Square to = pop_lsb(&b1); + (moveList++)->move = make_move(to - Up, to); + } + + while (b2) + { + Square to = pop_lsb(&b2); + (moveList++)->move = make_move(to - Up - Up, to); + } } // Promotions and underpromotions @@ -168,9 +174,9 @@ namespace { if (Type == EVASIONS) emptySquares &= target; - mlist = generate_promotions(mlist, pawnsOn7, enemies, ci); - mlist = generate_promotions(mlist, pawnsOn7, enemies, ci); - mlist = generate_promotions(mlist, pawnsOn7, emptySquares, ci); + moveList = generate_promotions(moveList, pawnsOn7, enemies, ci); + moveList = generate_promotions(moveList, pawnsOn7, enemies, ci); + moveList = generate_promotions(moveList, pawnsOn7, emptySquares, ci); } // Standard and en-passant captures @@ -179,8 +185,17 @@ namespace { b1 = shift_bb(pawnsNotOn7) & enemies; b2 = shift_bb(pawnsNotOn7) & enemies; - SERIALIZE_PAWNS(b1, Right); - SERIALIZE_PAWNS(b2, Left); + while (b1) + { + Square to = pop_lsb(&b1); + (moveList++)->move = make_move(to - Right, to); + } + + while (b2) + { + Square to = pop_lsb(&b2); + (moveList++)->move = make_move(to - Left, to); + } if (pos.ep_square() != SQ_NONE) { @@ -190,23 +205,23 @@ namespace { // is the double pushed pawn and so is in the target. Otherwise this // is a discovery check and we are forced to do otherwise. if (Type == EVASIONS && !(target & (pos.ep_square() - Up))) - return mlist; + return moveList; b1 = pawnsNotOn7 & pos.attacks_from(pos.ep_square(), Them); assert(b1); while (b1) - (mlist++)->move = make(pop_lsb(&b1), pos.ep_square()); + (moveList++)->move = make(pop_lsb(&b1), pos.ep_square()); } } - return mlist; + return moveList; } template FORCE_INLINE - ExtMove* generate_moves(const Position& pos, ExtMove* mlist, Color us, + ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Color us, Bitboard target, const CheckInfo* ci) { assert(Pt != KING && Pt != PAWN); @@ -230,47 +245,49 @@ namespace { if (Checks) b &= ci->checkSq[Pt]; - SERIALIZE(b); + while (b) + (moveList++)->move = make_move(from, pop_lsb(&b)); } - return mlist; + return moveList; } template FORCE_INLINE - ExtMove* generate_all(const Position& pos, ExtMove* mlist, Bitboard target, + ExtMove* generate_all(const Position& pos, ExtMove* moveList, Bitboard target, const CheckInfo* ci = NULL) { const bool Checks = Type == QUIET_CHECKS; - mlist = generate_pawn_moves(pos, mlist, target, ci); - mlist = generate_moves(pos, mlist, Us, target, ci); - mlist = generate_moves(pos, mlist, Us, target, ci); - mlist = generate_moves< ROOK, Checks>(pos, mlist, Us, target, ci); - mlist = generate_moves< QUEEN, Checks>(pos, mlist, Us, target, ci); + moveList = generate_pawn_moves(pos, moveList, target, ci); + moveList = generate_moves(pos, moveList, Us, target, ci); + moveList = generate_moves(pos, moveList, Us, target, ci); + moveList = generate_moves< ROOK, Checks>(pos, moveList, Us, target, ci); + moveList = generate_moves< QUEEN, Checks>(pos, moveList, Us, target, ci); if (Type != QUIET_CHECKS && Type != EVASIONS) { - Square from = pos.king_square(Us); - Bitboard b = pos.attacks_from(from) & target; - SERIALIZE(b); + Square ksq = pos.king_square(Us); + Bitboard b = pos.attacks_from(ksq) & target; + while (b) + (moveList++)->move = make_move(ksq, pop_lsb(&b)); } if (Type != CAPTURES && Type != EVASIONS && pos.can_castle(Us)) { if (pos.is_chess960()) { - mlist = generate_castle< KING_SIDE, Checks, true>(pos, mlist, Us); - mlist = generate_castle(pos, mlist, Us); + moveList = generate_castling::right, Checks, true>(pos, moveList, Us, ci); + moveList = generate_castling::right, Checks, true>(pos, moveList, Us, ci); } else { - mlist = generate_castle< KING_SIDE, Checks, false>(pos, mlist, Us); - mlist = generate_castle(pos, mlist, Us); + moveList = generate_castling::right, Checks, false>(pos, moveList, Us, ci); + moveList = generate_castling::right, Checks, false>(pos, moveList, Us, ci); } } - return mlist; + return moveList; } @@ -287,7 +304,7 @@ namespace { /// non-captures. Returns a pointer to the end of the move list. template -ExtMove* generate(const Position& pos, ExtMove* mlist) { +ExtMove* generate(const Position& pos, ExtMove* moveList) { assert(Type == CAPTURES || Type == QUIETS || Type == NON_EVASIONS); assert(!pos.checkers()); @@ -298,8 +315,8 @@ ExtMove* generate(const Position& pos, ExtMove* mlist) { : Type == QUIETS ? ~pos.pieces() : Type == NON_EVASIONS ? ~pos.pieces(us) : 0; - return us == WHITE ? generate_all(pos, mlist, target) - : generate_all(pos, mlist, target); + return us == WHITE ? generate_all(pos, moveList, target) + : generate_all(pos, moveList, target); } // Explicit template instantiations @@ -311,7 +328,7 @@ template ExtMove* generate(const Position&, ExtMove*); /// generate generates all pseudo-legal non-captures and knight /// underpromotions that give check. Returns a pointer to the end of the move list. template<> -ExtMove* generate(const Position& pos, ExtMove* mlist) { +ExtMove* generate(const Position& pos, ExtMove* moveList) { assert(!pos.checkers()); @@ -325,93 +342,71 @@ ExtMove* generate(const Position& pos, ExtMove* mlist) { PieceType pt = type_of(pos.piece_on(from)); if (pt == PAWN) - continue; // Will be generated togheter with direct checks + continue; // Will be generated together with direct checks Bitboard b = pos.attacks_from(Piece(pt), from) & ~pos.pieces(); if (pt == KING) b &= ~PseudoAttacks[QUEEN][ci.ksq]; - SERIALIZE(b); + while (b) + (moveList++)->move = make_move(from, pop_lsb(&b)); } - return us == WHITE ? generate_all(pos, mlist, ~pos.pieces(), &ci) - : generate_all(pos, mlist, ~pos.pieces(), &ci); + return us == WHITE ? generate_all(pos, moveList, ~pos.pieces(), &ci) + : generate_all(pos, moveList, ~pos.pieces(), &ci); } /// generate generates all pseudo-legal check evasions when the side /// to move is in check. Returns a pointer to the end of the move list. template<> -ExtMove* generate(const Position& pos, ExtMove* mlist) { +ExtMove* generate(const Position& pos, ExtMove* moveList) { assert(pos.checkers()); - int checkersCnt = 0; Color us = pos.side_to_move(); - Square ksq = pos.king_square(us), from = ksq /* For SERIALIZE */, checksq; + Square ksq = pos.king_square(us); Bitboard sliderAttacks = 0; - Bitboard b = pos.checkers(); - - assert(pos.checkers()); + Bitboard sliders = pos.checkers() & ~pos.pieces(KNIGHT, PAWN); - // Find squares attacked by slider checkers, we will remove them from the king - // evasions so to skip known illegal moves avoiding useless legality check later. - do + // Find all the squares attacked by slider checkers. We will remove them from + // the king evasions in order to skip known illegal moves, which avoids any + // useless legality checks later on. + while (sliders) { - ++checkersCnt; - checksq = pop_lsb(&b); - - assert(color_of(pos.piece_on(checksq)) == ~us); - - switch (type_of(pos.piece_on(checksq))) - { - case BISHOP: sliderAttacks |= PseudoAttacks[BISHOP][checksq]; break; - case ROOK: sliderAttacks |= PseudoAttacks[ROOK][checksq]; break; - case QUEEN: - // If queen and king are far or not on a diagonal line we can safely - // remove all the squares attacked in the other direction becuase are - // not reachable by the king anyway. - if (between_bb(ksq, checksq) || !(PseudoAttacks[BISHOP][checksq] & ksq)) - sliderAttacks |= PseudoAttacks[QUEEN][checksq]; - - // Otherwise we need to use real rook attacks to check if king is safe - // to move in the other direction. For example: king in B2, queen in A1 - // a knight in B1, and we can safely move to C1. - else - sliderAttacks |= PseudoAttacks[BISHOP][checksq] | pos.attacks_from(checksq); - - default: - break; - } - } while (b); + Square checksq = pop_lsb(&sliders); + sliderAttacks |= LineBB[checksq][ksq] ^ checksq; + } // Generate evasions for king, capture and non capture moves - b = pos.attacks_from(ksq) & ~pos.pieces(us) & ~sliderAttacks; - SERIALIZE(b); + Bitboard b = pos.attacks_from(ksq) & ~pos.pieces(us) & ~sliderAttacks; + while (b) + (moveList++)->move = make_move(ksq, pop_lsb(&b)); - if (checkersCnt > 1) - return mlist; // Double check, only a king move can save the day + if (more_than_one(pos.checkers())) + return moveList; // Double check, only a king move can save the day // Generate blocking evasions or captures of the checking piece + Square checksq = lsb(pos.checkers()); Bitboard target = between_bb(checksq, ksq) | checksq; - return us == WHITE ? generate_all(pos, mlist, target) - : generate_all(pos, mlist, target); + return us == WHITE ? generate_all(pos, moveList, target) + : generate_all(pos, moveList, target); } /// generate generates all the legal moves in the given position template<> -ExtMove* generate(const Position& pos, ExtMove* mlist) { +ExtMove* generate(const Position& pos, ExtMove* moveList) { - ExtMove *end, *cur = mlist; + ExtMove *end, *cur = moveList; Bitboard pinned = pos.pinned_pieces(pos.side_to_move()); Square ksq = pos.king_square(pos.side_to_move()); - end = pos.checkers() ? generate(pos, mlist) - : generate(pos, mlist); + end = pos.checkers() ? generate(pos, moveList) + : generate(pos, moveList); while (cur != end) if ( (pinned || from_sq(cur->move) == ksq || type_of(cur->move) == ENPASSANT) && !pos.legal(cur->move, pinned))