X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.cpp;h=3aede5adfa7f111b42ddef9332e9182a5dfba8f5;hp=3ad88fb206aa011ece4fb6dca4c75acf17edb758;hb=f3728e66f856a8916a12eada7b18049034c864ca;hpb=8447248705bc6cf91fc8cdbb519c31925862ea74 diff --git a/src/pawns.cpp b/src/pawns.cpp index 3ad88fb2..3aede5ad 100644 --- a/src/pawns.cpp +++ b/src/pawns.cpp @@ -79,8 +79,6 @@ namespace { PawnInfo* PawnInfoTable::get_pawn_info(const Position& pos) const { - assert(pos.is_ok()); - Key key = pos.get_pawn_key(); PawnInfo* pi = probe(key); @@ -127,15 +125,15 @@ Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns, Rank r; bool passed, isolated, doubled, opposed, chain, backward, candidate; Score value = SCORE_ZERO; - const Square* ptr = pos.piece_list_begin(Us, PAWN); + const Square* pl = pos.piece_list(Us, PAWN); // Loop through all pawns of the current color and score each pawn - while ((s = *ptr++) != SQ_NONE) + while ((s = *pl++) != SQ_NONE) { assert(pos.piece_on(s) == make_piece(Us, PAWN)); - f = square_file(s); - r = square_rank(s); + f = file_of(s); + r = rank_of(s); // This file cannot be half open pi->halfOpenFiles[Us] &= ~(1 << f); @@ -184,7 +182,7 @@ Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns, // pawn on neighboring files is higher or equal than the number of // enemy pawns in the forward direction on the neighboring files. candidate = !(opposed | passed | backward | isolated) - && (b = attack_span_mask(Them, s + pawn_push(Us)) & ourPawns) != EmptyBoardBB + && (b = attack_span_mask(Them, s + pawn_push(Us)) & ourPawns) != 0 && count_1s(b) >= count_1s(attack_span_mask(Us, s) & theirPawns); // Passed pawns will be properly scored in evaluation because we need @@ -225,12 +223,12 @@ Score PawnInfo::updateShelter(const Position& pos, Square ksq) { if (relative_rank(Us, ksq) <= RANK_4) { - pawns = pos.pieces(PAWN, Us) & this_and_neighboring_files_bb(ksq); + pawns = pos.pieces(PAWN, Us) & this_and_neighboring_files_bb(file_of(ksq)); r = ksq & (7 << 3); for (int i = 0; i < 3; i++) { r += Shift; - shelter += BitCount8Bit[(pawns >> r) & 0xFF] * (64 >> i); + shelter += BitCount8Bit[(pawns >> r) & 0xFF] << (6 - i); } } kingSquares[Us] = ksq;