X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.h;h=e6bc2c315a344b5987fe3ba2b1a1c100fafcc144;hp=2a1dff196ce594a09436e6e3c89efdc3cd08eca9;hb=55bd27b8f08a151128d7065fa2819aa3e9605299;hpb=b0b9bb3462d215f33c9f33323e64dc115746c4e0 diff --git a/src/pawns.h b/src/pawns.h index 2a1dff19..e6bc2c31 100644 --- a/src/pawns.h +++ b/src/pawns.h @@ -20,22 +20,22 @@ #if !defined(PAWNS_H_INCLUDED) #define PAWNS_H_INCLUDED +#include "misc.h" #include "position.h" -#include "tt.h" #include "types.h" const int PawnTableSize = 16384; -/// PawnInfo is a class which contains various information about a pawn +/// PawnEntry is a class which contains various information about a pawn /// structure. Currently, it only includes a middle game and an end game /// pawn structure evaluation, and a bitboard of passed pawns. We may want /// to add further information in the future. A lookup to the pawn hash -/// table (performed by calling the pawn_info method in a PawnInfoTable -/// object) returns a pointer to a PawnInfo object. +/// table (performed by calling the probe method in a PawnTable object) +/// returns a pointer to a PawnEntry object. -class PawnInfo { +class PawnEntry { - friend class PawnInfoTable; + friend struct PawnTable; public: Score pawns_value() const; @@ -59,52 +59,57 @@ private: Bitboard passedPawns[2]; Bitboard pawnAttacks[2]; Square kingSquares[2]; + int minKPdistance[2]; + int castleRights[2]; Score value; int halfOpenFiles[2]; - Score kingShelters[2]; + Score kingSafety[2]; }; -/// The PawnInfoTable class represents a pawn hash table. The most important -/// method is pawn_info, which returns a pointer to a PawnInfo object. +/// The PawnTable class represents a pawn hash table. The most important +/// method is probe, which returns a pointer to a PawnEntry object. -class PawnInfoTable : public SimpleHash { -public: - PawnInfo* pawn_info(const Position& pos) const; +struct PawnTable { + + PawnEntry* probe(const Position& pos); -private: template - static Score evaluate_pawns(const Position& pos, Bitboard ourPawns, Bitboard theirPawns, PawnInfo* pi); + static Score evaluate_pawns(const Position& pos, Bitboard ourPawns, + Bitboard theirPawns, PawnEntry* e); + + HashTable entries; }; -inline Score PawnInfo::pawns_value() const { +inline Score PawnEntry::pawns_value() const { return value; } -inline Bitboard PawnInfo::pawn_attacks(Color c) const { +inline Bitboard PawnEntry::pawn_attacks(Color c) const { return pawnAttacks[c]; } -inline Bitboard PawnInfo::passed_pawns(Color c) const { +inline Bitboard PawnEntry::passed_pawns(Color c) const { return passedPawns[c]; } -inline int PawnInfo::file_is_half_open(Color c, File f) const { +inline int PawnEntry::file_is_half_open(Color c, File f) const { return halfOpenFiles[c] & (1 << int(f)); } -inline int PawnInfo::has_open_file_to_left(Color c, File f) const { +inline int PawnEntry::has_open_file_to_left(Color c, File f) const { return halfOpenFiles[c] & ((1 << int(f)) - 1); } -inline int PawnInfo::has_open_file_to_right(Color c, File f) const { +inline int PawnEntry::has_open_file_to_right(Color c, File f) const { return halfOpenFiles[c] & ~((1 << int(f+1)) - 1); } template -inline Score PawnInfo::king_safety(const Position& pos, Square ksq) { - return kingSquares[Us] == ksq ? kingShelters[Us] : update_safety(pos, ksq); +inline Score PawnEntry::king_safety(const Position& pos, Square ksq) { + return kingSquares[Us] == ksq && castleRights[Us] == pos.can_castle(Us) + ? kingSafety[Us] : update_safety(pos, ksq); } #endif // !defined(PAWNS_H_INCLUDED)