X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.h;h=c2f5fc0d34ba51138df1d575b7eacddfcf712edd;hp=6124246229696291b3cfa162ba7cc1f87e83c374;hb=7c5d724724e826ff1fd9a97c8812d5a4bffaaa84;hpb=7ff865b924a5027ab3ecb5a6525ad165262fe3c2 diff --git a/src/pawns.h b/src/pawns.h index 61242462..c2f5fc0d 100644 --- a/src/pawns.h +++ b/src/pawns.h @@ -1,7 +1,8 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad + 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 @@ -32,10 +33,12 @@ namespace Pawns { struct Entry { - Score pawns_value() const { return value; } + Score pawns_score() const { return score; } Bitboard pawn_attacks(Color c) const { return pawnAttacks[c]; } Bitboard passed_pawns(Color c) const { return passedPawns[c]; } - Bitboard candidate_pawns(Color c) const { return candidatePawns[c]; } + Bitboard pawn_attacks_span(Color c) const { return pawnAttacksSpan[c]; } + int pawn_span(Color c) const { return pawnSpan[c]; } + int pawn_asymmetry() const { return asymmetry; } int semiopen_file(Color c, File f) const { return semiopenFiles[c] & (1 << f); @@ -45,16 +48,12 @@ struct Entry { return semiopenFiles[c] & (leftSide ? (1 << f) - 1 : ~((1 << (f + 1)) - 1)); } - int pawn_span(Color c) const { - return pawnSpan[c]; - } - int pawns_on_same_color_squares(Color c, Square s) const { return pawnsOnSquares[c][!!(DarkSquares & s)]; } template - Score king_safety(const Position& pos, Square ksq) { + Score king_safety(const Position& pos, Square ksq) { return kingSquares[Us] == ksq && castlingRights[Us] == pos.can_castle(Us) ? kingSafety[Us] : (kingSafety[Us] = do_king_safety(pos, ksq)); } @@ -66,23 +65,23 @@ struct Entry { Value shelter_storm(const Position& pos, Square ksq); Key key; - Score value; + Score score; Bitboard passedPawns[COLOR_NB]; - Bitboard candidatePawns[COLOR_NB]; Bitboard pawnAttacks[COLOR_NB]; + Bitboard pawnAttacksSpan[COLOR_NB]; Square kingSquares[COLOR_NB]; Score kingSafety[COLOR_NB]; - int minKPdistance[COLOR_NB]; int castlingRights[COLOR_NB]; int semiopenFiles[COLOR_NB]; int pawnSpan[COLOR_NB]; int pawnsOnSquares[COLOR_NB][COLOR_NB]; // [color][light/dark squares] + int asymmetry; }; typedef HashTable Table; void init(); -Entry* probe(const Position& pos, Table& entries); +Entry* probe(const Position& pos); } // namespace Pawns