X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fpawns.h;h=212b14488f116babcd5bd6226000426f9bdce784;hp=557580e11ca3f41ee674ab8a58ee1362249fe39f;hb=158014b39d69eaaf791d4913b98ffde5c4d7a874;hpb=4626ec2890b140829e9971658ca948005b945fd4 diff --git a/src/pawns.h b/src/pawns.h index 557580e1..212b1448 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-2009 Marco Costalba + Copyright (C) 2008-2012 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,121 +17,58 @@ along with this program. If not, see . */ - #if !defined(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; - -class PawnInfo { - - friend class PawnInfoTable; - -public: - PawnInfo() { clear(); } +#include "misc.h" +#include "position.h" +#include "types.h" - Score 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); +namespace Pawns { -private: - void clear(); - int updateShelter(const Position& pos, Color c, Square ksq); +/// 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. - Key key; - Bitboard passedPawns; - Bitboard pawnAttacks[2]; - int16_t mgValue, egValue; - int16_t ksStormValue[2], qsStormValue[2]; - uint8_t halfOpenFiles[2]; - Square kingSquares[2]; - uint8_t kingShelters[2]; -}; +struct Entry { -/// 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. + Score pawns_value() const { return value; } + Bitboard pawn_attacks(Color c) const { return pawnAttacks[c]; } + Bitboard passed_pawns(Color c) const { return passedPawns[c]; } + int file_is_half_open(Color c, File f) const { return halfOpenFiles[c] & (1 << int(f)); } + int has_open_file_to_left(Color c, File f) const { return halfOpenFiles[c] & ((1 << int(f)) - 1); } + int has_open_file_to_right(Color c, File f) const { return halfOpenFiles[c] & ~((1 << int(f+1)) - 1); } -class PawnInfoTable { + template + Score king_safety(const Position& pos, Square ksq) { -public: - PawnInfoTable(unsigned numOfEntries); - ~PawnInfoTable(); - PawnInfo* get_pawn_info(const Position& pos); + return kingSquares[Us] == ksq && castleRights[Us] == pos.can_castle(Us) + ? kingSafety[Us] : update_safety(pos, ksq); + } -private: - typedef std::pair Values; + template + Score update_safety(const Position& pos, Square ksq); template - Values 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 pawnAttacks[COLOR_NB]; + Square kingSquares[COLOR_NB]; + int minKPdistance[COLOR_NB]; + int castleRights[COLOR_NB]; + Score value; + int halfOpenFiles[COLOR_NB]; + Score kingSafety[COLOR_NB]; }; +typedef HashTable Table; -//// -//// Inline functions -//// - -inline Score PawnInfo::value() const { - return Score(mgValue, egValue); -} - -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); -} +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)