X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.cpp;h=86745924bcfe2f308f04a1f9290a7b22d399f27b;hp=ef456307cafbacb4479a53627a7a1d7b58aa362d;hb=e082112cfeb6a40ca592a15983cdedb0210daf3a;hpb=ddccb5355cabb7d1a9bf2c0fe3c51b3da0234260 diff --git a/src/pawns.cpp b/src/pawns.cpp index ef456307..86745924 100644 --- a/src/pawns.cpp +++ b/src/pawns.cpp @@ -2,6 +2,7 @@ Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, 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 @@ -21,7 +22,6 @@ #include #include "bitboard.h" -#include "bitcount.h" #include "pawns.h" #include "position.h" #include "thread.h" @@ -31,61 +31,58 @@ namespace { #define V Value #define S(mg, eg) make_score(mg, eg) + // Isolated pawn penalty by opposed flag and file + const Score Isolated[2][FILE_NB] = { + { S(31, 36), S(45, 41), S(50, 41), S(50, 41), + S(50, 41), S(50, 41), S(45, 41), S(31, 36) }, + { S(21, 24), S(30, 28), S(33, 28), S(33, 28), + S(33, 28), S(33, 28), S(30, 28), S(21, 24) } }; + + // Backward pawn penalty by opposed flag + const Score Backward[2] = { S(56, 33), S(41, 19) }; + + // Unsupported pawn penalty for pawns which are neither isolated or backward, + // by number of pawns it supports [less than 2 / exactly 2]. + const Score Unsupported[2] = { S(17, 8), S(21, 12) }; + + // Connected pawn bonus by opposed, phalanx, twice supported and rank + Score Connected[2][2][2][RANK_NB]; + // Doubled pawn penalty by file const Score Doubled[FILE_NB] = { - S(13, 43), S(20, 48), S(23, 48), S(23, 48), - S(23, 48), S(23, 48), S(20, 48), S(13, 43) }; + S(11, 34), S(17, 38), S(19, 38), S(19, 38), + S(19, 38), S(19, 38), S(17, 38), S(11, 34) }; - // Isolated pawn penalty by opposed flag and file - const Score Isolated[2][FILE_NB] = { - { S(37, 45), S(54, 52), S(60, 52), S(60, 52), - S(60, 52), S(60, 52), S(54, 52), S(37, 45) }, - { S(25, 30), S(36, 35), S(40, 35), S(40, 35), - S(40, 35), S(40, 35), S(36, 35), S(25, 30) } }; - - // Backward pawn penalty by opposed flag and file - const Score Backward[2][FILE_NB] = { - { S(30, 42), S(43, 46), S(49, 46), S(49, 46), - S(49, 46), S(49, 46), S(43, 46), S(30, 42) }, - { 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]; - - // Levers bonus by rank + // Lever bonus by rank const Score Lever[RANK_NB] = { - S( 0, 0), S( 0, 0), S(0, 0), S(0, 0), - S(20,20), S(40,40), S(0, 0), S(0, 0) }; - - // Unsupported pawn penalty - const Score UnsupportedPawnPenalty = S(20, 10); + S( 0, 0), S( 0, 0), S(0, 0), S(0, 0), + S(17, 16), S(33, 32), S(0, 0), S(0, 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) }, - { V(117), V( 1), V(27), V(71), V(94), V(104), V(118) }, - { V(104), V( 4), V(51), V(76), V(82), V(102), V( 97) }, - { V( 80), V(12), V(43), V(65), V(88), V( 91), V(115) } }; + { V( 97), V(21), V(26), V(51), V(87), V( 89), V( 99) }, + { V(120), V( 0), V(28), V(76), V(88), V(103), V(104) }, + { V(101), V( 7), V(54), V(78), V(77), V( 92), V(101) }, + { V( 80), V(11), V(44), V(68), V(87), V( 90), V(119) } }; // Danger of enemy pawns moving toward our king by [type][distance from edge][rank] const Value StormDanger[][4][RANK_NB] = { - { { V( 0), V( 65), V( 126), V(36), V(30) }, - { V( 0), V( 55), V( 135), V(36), V(23) }, - { V( 0), V( 47), V( 116), V(45), V(26) }, - { V( 0), V( 62), V( 127), V(57), V(34) } }, - { { V(21), V( 45), V( 93), V(50), V(19) }, - { V(23), V( 24), V( 105), V(41), V(13) }, - { V(23), V( 36), V( 101), V(38), V(20) }, - { V(30), V( 19), V( 110), V(41), V(27) } }, - { { V( 0), V( 0), V( 81), V(14), V( 4) }, - { V( 0), V( 0), V( 169), V(30), V( 3) }, - { V( 0), V( 0), V( 168), V(24), V( 5) }, - { V( 0), V( 0), V( 162), V(26), V(10) } }, - { { V( 0), V(-283), V(-298), V(57), V(29) }, - { V( 0), V( 63), V( 137), V(42), V(18) }, - { V( 0), V( 67), V( 145), V(49), V(33) }, - { V( 0), V( 62), V( 126), V(53), V(21) } } }; + { { V( 0), V( 67), V( 134), V(38), V(32) }, + { V( 0), V( 57), V( 139), V(37), V(22) }, + { V( 0), V( 43), V( 115), V(43), V(27) }, + { V( 0), V( 68), V( 124), V(57), V(32) } }, + { { V(20), V( 43), V( 100), V(56), V(20) }, + { V(23), V( 20), V( 98), V(40), V(15) }, + { V(23), V( 39), V( 103), V(36), V(18) }, + { V(28), V( 19), V( 108), V(42), V(26) } }, + { { V( 0), V( 0), V( 75), V(14), V( 2) }, + { V( 0), V( 0), V( 150), V(30), V( 4) }, + { V( 0), V( 0), V( 160), V(22), V( 5) }, + { V( 0), V( 0), V( 166), V(24), V(13) } }, + { { V( 0), V(-283), V(-281), V(57), V(31) }, + { V( 0), V( 58), V( 141), V(39), V(18) }, + { V( 0), V( 65), V( 142), V(48), V(32) }, + { V( 0), V( 60), V( 126), V(51), V(19) } } }; // Max bonus for king safety. Corresponds to start position with all the pawns // in front of the king and no enemy pawn on the horizon. @@ -102,21 +99,21 @@ 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, stoppers, doubled, supported, phalanx; Square s; - bool passed, isolated, opposed, phalanx, backward, unsupported, lever; + bool opposed, lever, connected, backward; Score score = SCORE_ZERO; - const Square* pl = pos.list(Us); + const Square* pl = pos.squares(Us); const Bitboard* pawnAttacksBB = StepAttacksBB[make_piece(Us, PAWN)]; Bitboard ourPawns = pos.pieces(Us , PAWN); Bitboard theirPawns = pos.pieces(Them, PAWN); - e->passedPawns[Us] = 0; + e->passedPawns[Us] = e->pawnAttacksSpan[Us] = 0; e->kingSquares[Us] = SQ_NONE; e->semiopenFiles[Us] = 0xFF; e->pawnAttacks[Us] = shift_bb(ourPawns) | shift_bb(ourPawns); - e->pawnsOnSquares[Us][BLACK] = popcount(ourPawns & DarkSquares); + e->pawnsOnSquares[Us][BLACK] = popcount(ourPawns & DarkSquares); e->pawnsOnSquares[Us][WHITE] = pos.count(Us) - e->pawnsOnSquares[Us][BLACK]; // Loop through all pawns of the current color and score each pawn @@ -126,67 +123,57 @@ namespace { File f = file_of(s); - // 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)); - doubled = ourPawns & forward_bb(Us, s); - opposed = theirPawns & forward_bb(Us, s); - passed = !(theirPawns & passed_pawn_mask(Us, s)); - lever = theirPawns & pawnAttacksBB[s]; - - // Test for backward pawn. - // If the pawn is passed, isolated, connected or a lever it cannot be - // backward. If there are friendly pawns behind on adjacent files - // it cannot be backward either. - if ( (passed | isolated | lever | connected) - || (ourPawns & pawn_attack_span(Them, s))) + e->pawnAttacksSpan[Us] |= pawn_attack_span(Us, s); + + // Flag the pawn + opposed = theirPawns & forward_bb(Us, s); + stoppers = theirPawns & passed_pawn_mask(Us, s); + lever = theirPawns & pawnAttacksBB[s]; + doubled = ourPawns & forward_bb(Us, s); + neighbours = ourPawns & adjacent_files_bb(f); + phalanx = neighbours & rank_bb(s); + supported = neighbours & rank_bb(s - Up); + connected = supported | phalanx; + + // A pawn is backward when it is behind all pawns of the same color on the + // adjacent files and cannot be safely advanced. + if (!neighbours || lever || relative_rank(Us, s) >= RANK_5) backward = false; else { - // We now know that 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. - b = pawn_attack_span(Us, s) & (ourPawns | theirPawns); - b = pawn_attack_span(Us, s) & rank_bb(backmost_sq(Us, b)); - - // If we have an enemy pawn in the same or next rank, the pawn is - // backward because it cannot advance without being captured. - backward = (b | shift_bb(b)) & theirPawns; + // Find the backmost rank with neighbours or stoppers + b = rank_bb(backmost_sq(Us, neighbours | stoppers)); + + // The pawn is backward when it cannot safely progress to that rank: + // either there is a stopper in the way on this rank, or there is a + // stopper on adjacent file which controls the way to that rank. + backward = (b | shift_bb(b & adjacent_files_bb(f))) & stoppers; + + assert(!backward || !(pawn_attack_span(Them, s + Up) & neighbours)); } - assert(opposed | passed | (pawn_attack_span(Us, s) & theirPawns)); - // Passed pawns will be properly scored in evaluation because we need - // full attack info to evaluate passed pawns. Only the frontmost passed + // full attack info to evaluate them. Only the frontmost passed // pawn on each file is considered a true passed pawn. - if (passed && !doubled) + if (!(stoppers | doubled)) e->passedPawns[Us] |= s; // Score this pawn - if (isolated) + if (!neighbours) score -= Isolated[opposed][f]; - if (unsupported && !isolated) - score -= UnsupportedPawnPenalty; + else if (backward) + score -= Backward[opposed]; - if (doubled) - score -= Doubled[f] / distance(s, frontmost_sq(Us, doubled)); - - if (backward) - score -= Backward[opposed][f]; + else if (!supported) + score -= Unsupported[more_than_one(neighbours & pawnAttacksBB[s])]; if (connected) - score += Connected[opposed][phalanx][relative_rank(Us, s)]; + score += Connected[opposed][!!phalanx][more_than_one(supported)][relative_rank(Us, s)]; + + if (doubled) + score -= Doubled[f] / distance(s, frontmost_sq(Us, doubled)); if (lever) score += Lever[relative_rank(Us, s)]; @@ -208,15 +195,17 @@ namespace Pawns { void init() { - static const int Seed[RANK_NB] = { 0, 6, 15, 10, 57, 75, 135, 258 }; + static const int Seed[RANK_NB] = { 0, 8, 19, 13, 71, 94, 169, 324 }; 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(v, v * 5 / 8); + } } @@ -235,6 +224,7 @@ Entry* probe(const Position& pos) { e->key = key; e->score = evaluate(pos, e) - evaluate(pos, e); + e->asymmetry = popcount(e->semiopenFiles[WHITE] ^ e->semiopenFiles[BLACK]); return e; } @@ -283,14 +273,11 @@ Score Entry::do_king_safety(const Position& pos, Square ksq) { kingSquares[Us] = ksq; castlingRights[Us] = pos.can_castle(Us); - minKingPawnDistance[Us] = 0; + int minKingPawnDistance = 0; Bitboard pawns = pos.pieces(Us, PAWN); if (pawns) - while (!(DistanceRingBB[ksq][minKingPawnDistance[Us]++] & pawns)) {} - - if (relative_rank(Us, ksq) > RANK_4) - return make_score(0, -16 * minKingPawnDistance[Us]); + while (!(DistanceRingBB[ksq][minKingPawnDistance++] & pawns)) {} Value bonus = shelter_storm(pos, ksq); @@ -301,7 +288,7 @@ Score Entry::do_king_safety(const Position& pos, Square ksq) { if (pos.can_castle(MakeCastling::right)) bonus = std::max(bonus, shelter_storm(pos, relative_square(Us, SQ_C1))); - return make_score(bonus, -16 * minKingPawnDistance[Us]); + return make_score(bonus, -16 * minKingPawnDistance); } // Explicit template instantiation