X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.h;h=525a6dccd043d85a88278508519b1e9e02317025;hp=2dc866848aa0cc3adb210ec24ef528caa7fdcc7f;hb=1d1b7df7c6b3496d1a3fe926cadf25d91e1558f6;hpb=a4a0ffce711962c0b04b35998c3c06491be373bf
diff --git a/src/pawns.h b/src/pawns.h
index 2dc86684..525a6dcc 100644
--- a/src/pawns.h
+++ b/src/pawns.h
@@ -1,7 +1,7 @@
/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, 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
@@ -17,119 +17,65 @@
along with this program. If not, see .
*/
-
-#if !defined(PAWNS_H_INCLUDED)
+#ifndef PAWNS_H_INCLUDED
#define PAWNS_H_INCLUDED
-////
-//// Includes
-////
-
-#include "bitboard.h"
-#include "value.h"
-
-////
-//// Types
-////
-
-/// 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 Position;
+#include "misc.h"
+#include "position.h"
+#include "types.h"
-class PawnInfo {
+namespace Pawns {
- friend class PawnInfoTable;
+/// Pawns::Entry contains various information about a pawn structure. Currently,
+/// it only includes a middlegame and endgame 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 function)
+/// returns a pointer to an Entry object.
-public:
- PawnInfo() { clear(); }
+struct Entry {
- Score pawns_value() const;
- Value kingside_storm_value(Color c) const;
- Value queenside_storm_value(Color c) const;
- Bitboard pawn_attacks(Color c) const;
- Bitboard passed_pawns() 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;
- int get_king_shelter(const Position& pos, Color c, Square ksq);
+ Score pawns_value() const { return value; }
+ 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]; }
+ int pawns_on_same_color_squares(Color c, Square s) const { return pawnsOnSquares[c][!!(DarkSquares & s)]; }
+ int semiopen(Color c, File f) const { return semiopenFiles[c] & (1 << int(f)); }
+ int semiopen_on_side(Color c, File f, bool left) const {
-private:
- void clear();
- int updateShelter(const Position& pos, Color c, Square ksq);
-
- Key key;
- Bitboard passedPawns;
- Bitboard pawnAttacks[2];
- Square kingSquares[2];
- Score value;
- int16_t ksStormValue[2], qsStormValue[2];
- uint8_t halfOpenFiles[2];
- uint8_t kingShelters[2];
-};
+ return semiopenFiles[c] & (left ? ((1 << int(f)) - 1) : ~((1 << int(f+1)) - 1));
+ }
-/// 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.
+ template
+ Score king_safety(const Position& pos, Square ksq) {
-class PawnInfoTable {
+ return kingSquares[Us] == ksq && castlingRights[Us] == pos.can_castle(Us)
+ ? kingSafety[Us] : update_safety(pos, ksq);
+ }
-public:
- PawnInfoTable(unsigned numOfEntries);
- ~PawnInfoTable();
- PawnInfo* get_pawn_info(const Position& pos);
+ template
+ Score update_safety(const Position& pos, Square ksq);
-private:
template
- Score evaluate_pawns(const Position& pos, Bitboard ourPawns, Bitboard theirPawns, PawnInfo* pi);
+ Value shelter_storm(const Position& pos, Square ksq);
- unsigned size;
- PawnInfo* entries;
+ Key key;
+ Bitboard passedPawns[COLOR_NB];
+ Bitboard candidatePawns[COLOR_NB];
+ Bitboard pawnAttacks[COLOR_NB];
+ Square kingSquares[COLOR_NB];
+ int minKPdistance[COLOR_NB];
+ int castlingRights[COLOR_NB];
+ Score value;
+ int semiopenFiles[COLOR_NB];
+ Score kingSafety[COLOR_NB];
+ int pawnsOnSquares[COLOR_NB][COLOR_NB];
};
+typedef HashTable Table;
-////
-//// Inline functions
-////
-
-inline Score PawnInfo::pawns_value() const {
- return value;
-}
-
-inline Bitboard PawnInfo::passed_pawns() const {
- return passedPawns;
-}
-
-inline Bitboard PawnInfo::pawn_attacks(Color c) const {
- return pawnAttacks[c];
-}
-
-inline Value PawnInfo::kingside_storm_value(Color c) const {
- return Value(ksStormValue[c]);
-}
-
-inline Value PawnInfo::queenside_storm_value(Color c) const {
- return Value(qsStormValue[c]);
-}
-
-inline int PawnInfo::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 {
- return halfOpenFiles[c] & ((1 << int(f)) - 1);
-}
-
-inline int PawnInfo::has_open_file_to_right(Color c, File f) const {
- return halfOpenFiles[c] & ~((1 << int(f+1)) - 1);
-}
+void init();
+Entry* probe(const Position& pos, Table& entries);
-inline int PawnInfo::get_king_shelter(const Position& pos, Color c, Square ksq) {
- return (kingSquares[c] == ksq ? kingShelters[c] : updateShelter(pos, c, ksq));
}
-#endif // !defined(PAWNS_H_INCLUDED)
+#endif // #ifndef PAWNS_H_INCLUDED