X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.cpp;h=0b5c59d3fae0df6048f7852f872557af5274f16b;hp=ef456307cafbacb4479a53627a7a1d7b58aa362d;hb=e53774bc49dd0aaa1c129ee98c09e1a56ef974fb;hpb=1277a428237eec3299c6606951fac014bb3ef851 diff --git a/src/pawns.cpp b/src/pawns.cpp index ef456307..0b5c59d3 100644 --- a/src/pawns.cpp +++ b/src/pawns.cpp @@ -50,8 +50,8 @@ namespace { { S(20, 28), S(29, 31), S(33, 31), S(33, 31), S(33, 31), S(33, 31), S(29, 31), S(20, 28) } }; - // Connected pawn bonus by opposed, phalanx flags and rank - Score Connected[2][2][RANK_NB]; + // Connected pawn bonus by opposed, phalanx, twice supported and rank + Score Connected[2][2][2][RANK_NB]; // Levers bonus by rank const Score Lever[RANK_NB] = { @@ -61,6 +61,14 @@ namespace { // Unsupported pawn penalty const Score UnsupportedPawnPenalty = S(20, 10); + // Center bind bonus: Two pawns controlling the same central square + const Bitboard CenterBindMask[COLOR_NB] = { + (FileDBB | FileEBB) & (Rank5BB | Rank6BB | Rank7BB), + (FileDBB | FileEBB) & (Rank4BB | Rank3BB | Rank2BB) + }; + + const Score CenterBind = S(16, 0); + // Weakness of our pawn shelter in front of the king by [distance from edge][rank] const Value ShelterWeakness[][RANK_NB] = { { V( 99), V(20), V(26), V(54), V(85), V( 92), V(108) }, @@ -102,9 +110,9 @@ namespace { const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW); const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE); - Bitboard b, p, doubled, connected; + Bitboard b, neighbours, doubled, connected, supported, phalanx; Square s; - bool passed, isolated, opposed, phalanx, backward, unsupported, lever; + bool passed, isolated, opposed, backward, lever; Score score = SCORE_ZERO; const Square* pl = pos.list(Us); const Bitboard* pawnAttacksBB = StepAttacksBB[make_piece(Us, PAWN)]; @@ -129,22 +137,19 @@ namespace { // This file cannot be semi-open e->semiopenFiles[Us] &= ~(1 << f); - // Previous rank - p = rank_bb(s - pawn_push(Us)); - - // Flag the pawn as passed, isolated, doubled, - // unsupported or connected (but not the backward one). - connected = ourPawns & adjacent_files_bb(f) & (rank_bb(s) | p); - phalanx = connected & rank_bb(s); - unsupported = !(ourPawns & adjacent_files_bb(f) & p); - isolated = !(ourPawns & adjacent_files_bb(f)); + // Flag the pawn + neighbours = ourPawns & adjacent_files_bb(f); doubled = ourPawns & forward_bb(Us, s); opposed = theirPawns & forward_bb(Us, s); passed = !(theirPawns & passed_pawn_mask(Us, s)); lever = theirPawns & pawnAttacksBB[s]; + phalanx = neighbours & rank_bb(s); + supported = neighbours & rank_bb(s - Up); + connected = supported | phalanx; + isolated = !neighbours; // Test for backward pawn. - // If the pawn is passed, isolated, connected or a lever it cannot be + // If the pawn is passed, isolated, lever or connected it cannot be // backward. If there are friendly pawns behind on adjacent files // it cannot be backward either. if ( (passed | isolated | lever | connected) @@ -152,7 +157,7 @@ namespace { backward = false; else { - // We now know that there are no friendly pawns beside or behind this + // We now know there are no friendly pawns beside or behind this // pawn on adjacent files. We now check whether the pawn is // backward by looking in the forward direction on the adjacent // files, and picking the closest pawn there. @@ -176,7 +181,7 @@ namespace { if (isolated) score -= Isolated[opposed][f]; - if (unsupported && !isolated) + if (!supported && !isolated) score -= UnsupportedPawnPenalty; if (doubled) @@ -186,7 +191,7 @@ namespace { score -= Backward[opposed][f]; if (connected) - score += Connected[opposed][phalanx][relative_rank(Us, s)]; + score += Connected[opposed][!!phalanx][more_than_one(supported)][relative_rank(Us, s)]; if (lever) score += Lever[relative_rank(Us, s)]; @@ -195,6 +200,10 @@ namespace { b = e->semiopenFiles[Us] ^ 0xFF; e->pawnSpan[Us] = b ? int(msb(b) - lsb(b)) : 0; + // Center binds: Two pawns controlling the same central square + b = shift_bb(ourPawns) & shift_bb(ourPawns) & CenterBindMask[Us]; + score += popcount(b) * CenterBind; + return score; } @@ -212,11 +221,13 @@ void init() for (int opposed = 0; opposed <= 1; ++opposed) for (int phalanx = 0; phalanx <= 1; ++phalanx) - for (Rank r = RANK_2; r < RANK_8; ++r) - { - int bonus = Seed[r] + (phalanx ? (Seed[r + 1] - Seed[r]) / 2 : 0); - Connected[opposed][phalanx][r] = make_score(bonus / 2, bonus >> opposed); - } + for (int apex = 0; apex <= 1; ++apex) + for (Rank r = RANK_2; r < RANK_8; ++r) + { + int v = (Seed[r] + (phalanx ? (Seed[r + 1] - Seed[r]) / 2 : 0)) >> opposed; + v += (apex ? v / 2 : 0); + Connected[opposed][phalanx][apex][r] = make_score(3 * v / 2, v); + } }