- Value mgValue[2] = {Value(0), Value(0)};
- Value egValue[2] = {Value(0), Value(0)};
-
- // Loop through the pawns for both colors:
- for(Color us = WHITE; us <= BLACK; us++) {
- Color them = opposite_color(us);
- Bitboard ourPawns = pos.pawns(us);
- Bitboard theirPawns = pos.pawns(them);
- Bitboard pawns = ourPawns;
-
- // Initialize pawn storm scores by giving bonuses for open files:
- if(EvaluatePawnStorms)
- for(File f = FILE_A; f <= FILE_H; f++)
- if(pos.file_is_half_open(us, f)) {
- pi->ksStormValue[us] += KStormOpenFileBonus[f];
- pi->qsStormValue[us] += QStormOpenFileBonus[f];
- }
-
- // Loop through all pawns of the current color and score each pawn:
- while(pawns) {
- Square s = pop_1st_bit(&pawns);
- File f = square_file(s);
- Rank r = square_rank(s);
- bool passed, doubled, isolated, backward, chain, candidate;
- int bonus;
-
- assert(pos.piece_on(s) == pawn_of_color(us));
-
- // The file containing the pawn is not half open:
- pi->halfOpenFiles[us] &= ~(1 << f);
-
- // Passed, isolated or doubled pawn?
- passed = pos.pawn_is_passed(us, s);
- isolated = pos.pawn_is_isolated(us, s);
- doubled = pos.pawn_is_doubled(us, s);
-
- if(EvaluatePawnStorms) {
- // We calculate kingside and queenside pawn storm
- // scores for both colors. These are used when evaluating
- // middle game positions with opposite side castling.
- //
- // Each pawn is given a base score given by a piece square table
- // (KStormTable[] or QStormTable[]). This score is increased if
- // there are enemy pawns on adjacent files in front of the pawn.
- // This is because we want to be able to open files against the
- // enemy king, and to avoid blocking the pawn structure (e.g. white
- // pawns on h6, g5, black pawns on h7, g6, f7).
-
- // Kingside pawn storms:
- bonus = KStormTable[relative_square(us, s)];
- if(bonus > 0 && outpost_mask(us, s) & theirPawns) {
- switch(f) {
-
- case FILE_F:
- bonus += bonus / 4;
- break;
-
- case FILE_G:
- bonus += bonus / 2 + bonus / 4;
- break;
-
- case FILE_H:
- bonus += bonus / 2;
- break;
-
- default:
- break;
- }
- }
- pi->ksStormValue[us] += bonus;
-
- // Queenside pawn storms:
- bonus = QStormTable[relative_square(us, s)];
- if(bonus > 0 && passed_pawn_mask(us, s) & theirPawns) {
- switch(f) {
-
- case FILE_A:
- bonus += bonus / 2;
- break;
-
- case FILE_B:
- bonus += bonus / 2 + bonus / 4;
- break;
-
- case FILE_C:
- bonus += bonus / 2;
- break;
-
- default:
- break;
- }
- }
- pi->qsStormValue[us] += bonus;
+ // Calculate pawn attacks
+ Bitboard whitePawns = pos.pieces(PAWN, WHITE);
+ Bitboard blackPawns = pos.pieces(PAWN, BLACK);
+ pi->pawnAttacks[WHITE] = ((whitePawns << 9) & ~FileABB) | ((whitePawns << 7) & ~FileHBB);
+ pi->pawnAttacks[BLACK] = ((blackPawns >> 7) & ~FileABB) | ((blackPawns >> 9) & ~FileHBB);
+
+ // Evaluate pawns for both colors
+ pi->value = evaluate_pawns<WHITE>(pos, whitePawns, blackPawns, pi)
+ - evaluate_pawns<BLACK>(pos, blackPawns, whitePawns, pi);
+ return pi;
+}
+
+
+/// PawnInfoTable::evaluate_pawns() evaluates each pawn of the given color
+
+template<Color Us>
+Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns,
+ Bitboard theirPawns, PawnInfo* pi) const {
+ Bitboard b;
+ Square s;
+ File f;
+ Rank r;
+ int bonus;
+ bool passed, isolated, doubled, opposed, chain, backward, candidate;
+ Score value = make_score(0, 0);
+ const Square* ptr = pos.piece_list_begin(Us, PAWN);
+
+ // Initialize pawn storm scores by giving bonuses for open files
+ for (f = FILE_A; f <= FILE_H; f++)
+ if (!(ourPawns & file_bb(f)))
+ {
+ pi->ksStormValue[Us] += KStormOpenFileBonus[f];
+ pi->qsStormValue[Us] += QStormOpenFileBonus[f];
+ pi->halfOpenFiles[Us] |= (1 << f);