X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.h;h=e6bc2c315a344b5987fe3ba2b1a1c100fafcc144;hp=c4a616c2d766de3fe7698ce3d512e72117a3747a;hb=55bd27b8f08a151128d7065fa2819aa3e9605299;hpb=bb751d6c890f5c50c642366d601740366cfae8d0
diff --git a/src/pawns.h b/src/pawns.h
index c4a616c2..e6bc2c31 100644
--- a/src/pawns.h
+++ b/src/pawns.h
@@ -1,130 +1,115 @@
/*
- Glaurung, a UCI chess playing engine.
- Copyright (C) 2004-2008 Tord Romstad
+ Stockfish, a UCI chess playing engine derived from Glaurung 2.1
+ Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
+ Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
- Glaurung is free software: you can redistribute it and/or modify
+ Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
-
- Glaurung is distributed in the hope that it will be useful,
+
+ Stockfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
-
+
You should have received a copy of the GNU General Public License
along with this program. If not, see .
*/
-
#if !defined(PAWNS_H_INCLUDED)
#define PAWNS_H_INCLUDED
-////
-//// Includes
-////
-
+#include "misc.h"
#include "position.h"
+#include "types.h"
+const int PawnTableSize = 16384;
-////
-//// Types
-////
+/// 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 probe method in a PawnTable object)
+/// returns a pointer to a PawnEntry object.
-/// PawnInfo 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 get_pawn_info method in a PawnInfoTable object)
-/// returns a pointer to a PawnInfo object.
+class PawnEntry {
-class PawnInfo {
-
- friend class PawnInfoTable;
+ friend struct PawnTable;
public:
- Value mg_value() const;
- Value eg_value() const;
- Value kingside_storm_value(Color c) const;
- Value queenside_storm_value(Color c) const;
- Bitboard passed_pawns() const;
- bool file_is_half_open(Color c, File f) const;
- bool has_open_file_to_left(Color c, File f) const;
- bool has_open_file_to_right(Color c, File f) const;
+ Score pawns_value() const;
+ Bitboard pawn_attacks(Color c) const;
+ Bitboard passed_pawns(Color c) const;
+ int file_is_half_open(Color c, File f) const;
+ int has_open_file_to_left(Color c, File f) const;
+ int has_open_file_to_right(Color c, File f) const;
+
+ template
+ Score king_safety(const Position& pos, Square ksq);
private:
- void clear();
+ template
+ Score update_safety(const Position& pos, Square ksq);
+
+ template
+ Value shelter_storm(const Position& pos, Square ksq);
Key key;
- Bitboard passedPawns;
- int16_t mgValue, egValue;
- int8_t ksStormValue[2], qsStormValue[2];
- uint8_t halfOpenFiles[2];
+ Bitboard passedPawns[2];
+ Bitboard pawnAttacks[2];
+ Square kingSquares[2];
+ int minKPdistance[2];
+ int castleRights[2];
+ Score value;
+ int halfOpenFiles[2];
+ Score kingSafety[2];
};
-/// The PawnInfoTable class represents a pawn hash table. It is basically
-/// just an array of PawnInfo objects and a few methods for accessing these
-/// objects. The most important method is get_pawn_info, which looks up a
-/// position in the table and returns a pointer to a PawnInfo object.
-
-class PawnInfoTable {
+/// The PawnTable class represents a pawn hash table. The most important
+/// method is probe, which returns a pointer to a PawnEntry object.
-public:
- PawnInfoTable(unsigned numOfEntries);
- ~PawnInfoTable();
- void clear();
- PawnInfo *get_pawn_info(const Position &pos);
-
-private:
- unsigned size;
- PawnInfo *entries;
-};
+struct PawnTable {
+ PawnEntry* probe(const Position& pos);
-////
-//// Inline functions
-////
+ template
+ static Score evaluate_pawns(const Position& pos, Bitboard ourPawns,
+ Bitboard theirPawns, PawnEntry* e);
-inline Value PawnInfo::mg_value() const {
- return Value(mgValue);
-}
+ HashTable entries;
+};
-inline Value PawnInfo::eg_value() const {
- return Value(egValue);
-}
-inline Bitboard PawnInfo::passed_pawns() const {
- return passedPawns;
+inline Score PawnEntry::pawns_value() const {
+ return value;
}
-inline Value PawnInfo::kingside_storm_value(Color c) const {
- return Value(ksStormValue[c]);
+inline Bitboard PawnEntry::pawn_attacks(Color c) const {
+ return pawnAttacks[c];
}
-inline Value PawnInfo::queenside_storm_value(Color c) const {
- return Value(qsStormValue[c]);
+inline Bitboard PawnEntry::passed_pawns(Color c) const {
+ return passedPawns[c];
}
-inline bool PawnInfo::file_is_half_open(Color c, File f) const {
- return (halfOpenFiles[c] & (1 << int(f)));
+inline int PawnEntry::file_is_half_open(Color c, File f) const {
+ return halfOpenFiles[c] & (1 << int(f));
}
-inline bool 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 bool 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);
}
-inline void PawnInfo::clear() {
- mgValue = egValue = 0;
- passedPawns = EmptyBoardBB;
- ksStormValue[WHITE] = ksStormValue[BLACK] = 0;
- qsStormValue[WHITE] = qsStormValue[BLACK] = 0;
- halfOpenFiles[WHITE] = halfOpenFiles[BLACK] = 0xFF;
+template
+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)