X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fevaluate.cpp;h=a01a3c2c08c4b4089296129a0291734b548af04b;hb=9f5b709db7de800a931d3e4d78ada5f51001eeac;hp=23597231641f1215deff1b72d5d52f0776ee7bf0;hpb=5cacefe7c67b34dafe494e5155bce717289eeaf1;p=stockfish diff --git a/src/evaluate.cpp b/src/evaluate.cpp index 23597231..a01a3c2c 100644 --- a/src/evaluate.cpp +++ b/src/evaluate.cpp @@ -272,11 +272,11 @@ namespace { uint8_t BitCount8Bit[256]; // Function prototypes - void evaluate_knight(const Position &p, Square s, Color us, EvalInfo &ei); - void evaluate_bishop(const Position &p, Square s, Color us, EvalInfo &ei); - void evaluate_rook(const Position &p, Square s, Color us, EvalInfo &ei); - void evaluate_queen(const Position &p, Square s, Color us, EvalInfo &ei); - void evaluate_king(const Position &p, Square s, Color us, EvalInfo &ei); + void evaluate_knight(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei); + void evaluate_bishop(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei); + void evaluate_rook(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei); + void evaluate_queen(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei); + void evaluate_king(const Position& p, Square s, Color us, EvalInfo& ei); void evaluate_passed_pawns(const Position &pos, EvalInfo &ei); void evaluate_trapped_bishop_a7h7(const Position &pos, Square s, Color us, @@ -352,21 +352,23 @@ Value evaluate(const Position &pos, EvalInfo &ei, int threadID) { // Evaluate pieces for (Color c = WHITE; c <= BLACK; c++) { + Bitboard pinned = pos.pinned_pieces(c); + // Knights for (int i = 0; i < pos.piece_count(c, KNIGHT); i++) - evaluate_knight(pos, pos.piece_list(c, KNIGHT, i), c, ei); + evaluate_knight(pos, pos.piece_list(c, KNIGHT, i), c, pinned, ei); // Bishops for (int i = 0; i < pos.piece_count(c, BISHOP); i++) - evaluate_bishop(pos, pos.piece_list(c, BISHOP, i), c, ei); + evaluate_bishop(pos, pos.piece_list(c, BISHOP, i), c, pinned, ei); // Rooks for (int i = 0; i < pos.piece_count(c, ROOK); i++) - evaluate_rook(pos, pos.piece_list(c, ROOK, i), c, ei); + evaluate_rook(pos, pos.piece_list(c, ROOK, i), c, pinned, ei); // Queens for(int i = 0; i < pos.piece_count(c, QUEEN); i++) - evaluate_queen(pos, pos.piece_list(c, QUEEN, i), c, ei); + evaluate_queen(pos, pos.piece_list(c, QUEEN, i), c, pinned, ei); // Special pattern: trapped bishops on a7/h7/a2/h2 Bitboard b = pos.bishops(c) & MaskA7H7[c]; @@ -559,37 +561,53 @@ namespace { // evaluate_common() computes terms common to all pieces attack - int evaluate_common(const Position&p, const Bitboard& b, Color us, EvalInfo& ei, - int AttackWeight, const Value* mgBonus, const Value* egBonus, - Square s = SQ_NONE, const Value* OutpostBonus = NULL) { + template + int evaluate_common(const Position& p, const Bitboard& b, Color us, Bitboard pinned, EvalInfo& ei, Square s = SQ_NONE) { + + static const int AttackWeight[] = { 0, 0, KnightAttackWeight, BishopAttackWeight, RookAttackWeight, QueenAttackWeight }; + static const Value* MgBonus[] = { 0, 0, MidgameKnightMobilityBonus, MidgameBishopMobilityBonus, MidgameRookMobilityBonus, MidgameQueenMobilityBonus }; + static const Value* EgBonus[] = { 0, 0, EndgameKnightMobilityBonus, EndgameBishopMobilityBonus, EndgameRookMobilityBonus, EndgameQueenMobilityBonus }; + static const Value* OutpostBonus[] = { 0, 0, KnightOutpostBonus, BishopOutpostBonus, 0, 0 }; + int mob; Color them = opposite_color(us); + // Update attack info + ei.attackedBy[us][Piece] |= b; + // King attack if (b & ei.kingZone[us]) { ei.kingAttackersCount[us]++; - ei.kingAttackersWeight[us] += AttackWeight; + ei.kingAttackersWeight[us] += AttackWeight[Piece]; Bitboard bb = (b & ei.attackedBy[them][KING]); if (bb) ei.kingAdjacentZoneAttacksCount[us] += count_1s_max_15(bb); } - // Remove squares protected by enemy pawns - Bitboard bb = (b & ~ei.attackedBy[them][PAWN]); + if (pinned && bit_is_set(pinned, s)) + mob = 0; + else + { + // Remove squares protected by enemy pawns + Bitboard bb = (b & ~ei.attackedBy[them][PAWN]); - // Mobility - int mob = count_1s_max_15(bb & ~p.pieces_of_color(us)); - ei.mgMobility += Sign[us] * mgBonus[mob]; - ei.egMobility += Sign[us] * egBonus[mob]; + // Mobility + mob = (Piece != QUEEN ? count_1s_max_15(bb & ~p.pieces_of_color(us)) + : count_1s(bb & ~p.pieces_of_color(us))); + + ei.mgMobility += Sign[us] * MgBonus[Piece][mob]; + ei.egMobility += Sign[us] * EgBonus[Piece][mob]; + } // Bishop and Knight outposts - if (!OutpostBonus || !p.square_is_weak(s, them)) + if ( (Piece != BISHOP && Piece != KNIGHT) // compile time condition + || !p.square_is_weak(s, them)) return mob; // Initial bonus based on square Value v, bonus; - v = bonus = OutpostBonus[relative_square(us, s)]; + v = bonus = OutpostBonus[Piece][relative_square(us, s)]; // Increase bonus if supported by pawn, especially if the opponent has // no minor piece which can exchange the outpost piece @@ -609,42 +627,34 @@ namespace { // evaluate_knight() assigns bonuses and penalties to a knight of a given // color on a given square. - void evaluate_knight(const Position &p, Square s, Color us, EvalInfo &ei) { + void evaluate_knight(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei) { - Bitboard b = p.piece_attacks(s); - ei.attackedBy[us][KNIGHT] |= b; - - // King attack, mobility and outposts - evaluate_common(p, b, us, ei, KnightAttackWeight, MidgameKnightMobilityBonus, - EndgameKnightMobilityBonus, s, KnightOutpostBonus); + // Attacks, mobility and outposts + evaluate_common(p, p.piece_attacks(s), us, pinned, ei, s); } // evaluate_bishop() assigns bonuses and penalties to a bishop of a given // color on a given square. - void evaluate_bishop(const Position &p, Square s, Color us, EvalInfo &ei) { + void evaluate_bishop(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei) { Bitboard b = bishop_attacks_bb(s, p.occupied_squares() & ~p.queens(us)); - ei.attackedBy[us][BISHOP] |= b; - // King attack, mobility and outposts - evaluate_common(p, b, us, ei, BishopAttackWeight, MidgameBishopMobilityBonus, - EndgameBishopMobilityBonus, s, BishopOutpostBonus); + // Attacks, mobility and outposts + evaluate_common(p, b, us, pinned, ei, s); } // evaluate_rook() assigns bonuses and penalties to a rook of a given // color on a given square. - void evaluate_rook(const Position &p, Square s, Color us, EvalInfo &ei) { + void evaluate_rook(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei) { Bitboard b = rook_attacks_bb(s, p.occupied_squares() & ~p.rooks_and_queens(us)); - ei.attackedBy[us][ROOK] |= b; - // King attack and mobility - int mob = evaluate_common(p, b, us, ei, RookAttackWeight, MidgameRookMobilityBonus, - EndgameRookMobilityBonus); + // Attacks and mobility + int mob = evaluate_common(p, b, us, pinned, ei); // Rook on 7th rank Color them = opposite_color(us); @@ -703,14 +713,10 @@ namespace { // evaluate_queen() assigns bonuses and penalties to a queen of a given // color on a given square. - void evaluate_queen(const Position &p, Square s, Color us, EvalInfo &ei) { - - Bitboard b = p.piece_attacks(s); - ei.attackedBy[us][QUEEN] |= b; + void evaluate_queen(const Position& p, Square s, Color us, Bitboard pinned, EvalInfo& ei) { - // King attack and mobility - evaluate_common(p, b, us, ei, QueenAttackWeight, MidgameQueenMobilityBonus, - EndgameQueenMobilityBonus); + // Attacks and mobility + evaluate_common(p, p.piece_attacks(s), us, pinned, ei); // Queen on 7th rank Color them = opposite_color(us); @@ -731,7 +737,7 @@ namespace { // evaluate_king() assigns bonuses and penalties to a king of a given // color on a given square. - void evaluate_king(const Position &p, Square s, Color us, EvalInfo &ei) { + void evaluate_king(const Position& p, Square s, Color us, EvalInfo& ei) { int shelter = 0, sign = Sign[us]; @@ -1076,7 +1082,7 @@ namespace { Square b6 = relative_square(us, (square_file(s) == FILE_A) ? SQ_B6 : SQ_G6); Square b8 = relative_square(us, (square_file(s) == FILE_A) ? SQ_B8 : SQ_G8); - if ( pos.piece_on(b6) == pawn_of_color(opposite_color(us)) + if ( pos.piece_on(b6) == piece_of_color_and_type(opposite_color(us), PAWN) && pos.see(s, b6) < 0 && pos.see(s, b8) < 0) { @@ -1093,7 +1099,7 @@ namespace { void evaluate_trapped_bishop_a1h1(const Position &pos, Square s, Color us, EvalInfo &ei) { - Piece pawn = pawn_of_color(us); + Piece pawn = piece_of_color_and_type(us, PAWN); Square b2, b3, c3; assert(Chess960);