X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fpawns.h;h=0098a963db224a478d74eed4164d24acb5ffebad;hb=bd1c3ed7e32d3df0ceb29cb6959599e3cac2057c;hp=77a09f29acae57eeb95273f3c3dcecd8d28139e2;hpb=5b2ac7590ccfe529698347981e45fdfa8a0a0780;p=stockfish
diff --git a/src/pawns.h b/src/pawns.h
index 77a09f29..0098a963 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-2013 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,145 +17,64 @@
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 "misc.h"
#include "position.h"
-#include "tt.h"
-#include "value.h"
+#include "types.h"
+namespace Pawns {
-////
-//// Types
-////
+/// Pawns::Entry contains various information about a pawn structure. Currently,
+/// it only includes a middle game and 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 function)
+/// returns a pointer to an Entry object.
-const int PawnTableSize = 16384;
+struct Entry {
-/// 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 PawnInfo {
+ 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 {
- friend class PawnInfoTable;
+ return semiopenFiles[c] & (left ? ((1 << int(f)) - 1) : ~((1 << int(f+1)) - 1));
+ }
-public:
- 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) {
+
+ return kingSquares[Us] == ksq && castleRights[Us] == pos.can_castle(Us)
+ ? kingSafety[Us] : update_safety(pos, ksq);
+ }
template
- Score king_shelter(const Position& pos, Square ksq);
+ Score update_safety(const Position& pos, Square ksq);
-private:
template
- Score updateShelter(const Position& pos, Square ksq);
+ Value shelter_storm(const Position& pos, Square ksq);
Key key;
- Bitboard passedPawns[2];
- Bitboard pawnAttacks[2];
- Square kingSquares[2];
+ Bitboard passedPawns[COLOR_NB];
+ Bitboard candidatePawns[COLOR_NB];
+ Bitboard pawnAttacks[COLOR_NB];
+ Square kingSquares[COLOR_NB];
+ int minKPdistance[COLOR_NB];
+ int castleRights[COLOR_NB];
Score value;
- int halfOpenFiles[2];
- Score kingShelters[2];
+ int semiopenFiles[COLOR_NB];
+ Score kingSafety[COLOR_NB];
+ int pawnsOnSquares[COLOR_NB][COLOR_NB];
};
+typedef HashTable Table;
-/// The PawnInfoTable class represents a pawn hash table. The most important
-/// method is get_pawn_info, which returns a pointer to a PawnInfo object.
-
-class PawnInfoTable : public SimpleHash {
-
- enum SideType { KingSide, QueenSide };
-
-public:
- PawnInfo* get_pawn_info(const Position& pos) const;
- void prefetch(Key key) const;
-
-private:
- template
- Score evaluate_pawns(const Position& pos, Bitboard ourPawns, Bitboard theirPawns, PawnInfo* pi) const;
-};
-
-
-////
-//// Inline functions
-////
-
-inline Square pawn_push(Color c) {
- return c == WHITE ? DELTA_N : DELTA_S;
-}
-
-inline void PawnInfoTable::prefetch(Key key) const {
-
- unsigned index = unsigned(key & (PawnTableSize - 1));
- PawnInfo* pi = entries + index;
- ::prefetch((char*) pi);
-}
-
-inline Score PawnInfo::pawns_value() const {
- return value;
-}
-
-inline Bitboard PawnInfo::pawn_attacks(Color c) const {
- return pawnAttacks[c];
-}
-
-inline Bitboard PawnInfo::passed_pawns(Color c) const {
- return passedPawns[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);
-}
-
-/// PawnInfo::updateShelter() calculates and caches king shelter. It is called
-/// only when king square changes, about 20% of total king_shelter() calls.
-template
-Score PawnInfo::updateShelter(const Position& pos, Square ksq) {
-
- const int Shift = (Us == WHITE ? 8 : -8);
-
- Bitboard pawns;
- int r, shelter = 0;
-
- if (relative_rank(Us, ksq) <= RANK_4)
- {
- pawns = pos.pieces(PAWN, Us) & this_and_neighboring_files_bb(ksq);
- r = square_rank(ksq) * 8;
- for (int i = 1; i < 4; i++)
- {
- r += Shift;
- shelter += BitCount8Bit[(pawns >> r) & 0xFF] * (128 >> i);
- }
- }
- kingSquares[Us] = ksq;
- kingShelters[Us] = make_score(shelter, 0);
- return kingShelters[Us];
-}
+Entry* probe(const Position& pos, Table& entries);
-template
-inline Score PawnInfo::king_shelter(const Position& pos, Square ksq) {
- return kingSquares[Us] == ksq ? kingShelters[Us] : updateShelter(pos, ksq);
}
-#endif // !defined(PAWNS_H_INCLUDED)
+#endif // #ifndef PAWNS_H_INCLUDED