X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fevaluate.h;h=d859582a6681e7284eca05e4c3e2e1955f06bda3;hp=6a8ef7f16244dd181da636989dc3b9ff7c6bffc9;hb=6fa6da3ee13d2b7bdbec3cd24ff8ca43233c74fb;hpb=fff59319b01a9d0ef24e37e09027f5b58cb11136 diff --git a/src/evaluate.h b/src/evaluate.h index 6a8ef7f1..d859582a 100644 --- a/src/evaluate.h +++ b/src/evaluate.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-2015 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,89 +17,23 @@ along with this program. If not, see . */ - -#if !defined(EVALUATE_H_INCLUDED) +#ifndef EVALUATE_H_INCLUDED #define EVALUATE_H_INCLUDED -//// -//// Includes -//// - -#include - -#include "material.h" -#include "pawns.h" - +#include -//// -//// Types -//// +#include "types.h" - -/// The EvalInfo struct contains various information computed and collected -/// by the evaluation function. An EvalInfo object is passed as one of the -/// arguments to the evaluation function, and the search can make use of its -/// contents to make intelligent search decisions. -/// -/// At the moment, this is not utilized very much: The only part of the -/// EvalInfo object which is used by the search is margin. class Position; -struct EvalInfo { - - // Middle and end game position's static evaluations - Score value; - - // margin[color] stores the evaluation margins we should consider for - // the given position. This is a kind of uncertainty estimation and - // typically is used by the search for pruning decisions. - Value margin[2]; - - // Pointers to material and pawn hash table entries - MaterialInfo* mi; - PawnInfo* pi; - - // attackedBy[color][piece type] is a bitboard representing all squares - // attacked by a given color and piece type, attackedBy[color][0] contains - // all squares attacked by the given color. - Bitboard attackedBy[2][8]; - - // kingZone[color] is the zone around the enemy king which is considered - // by the king safety evaluation. This consists of the squares directly - // adjacent to the king, and the three (or two, for a king on an edge file) - // squares two ranks in front of the king. For instance, if black's king - // is on g8, kingZone[WHITE] is a bitboard containing the squares f8, h8, - // f7, g7, h7, f6, g6 and h6. - Bitboard kingZone[2]; - - // kingAttackersCount[color] is the number of pieces of the given color - // which attack a square in the kingZone of the enemy king. - int kingAttackersCount[2]; - - // kingAttackersWeight[color] is the sum of the "weight" of the pieces of the - // given color which attack a square in the kingZone of the enemy king. The - // weights of the individual piece types are given by the variables - // QueenAttackWeight, RookAttackWeight, BishopAttackWeight and - // KnightAttackWeight in evaluate.cpp - int kingAttackersWeight[2]; - - // kingAdjacentZoneAttacksCount[color] is the number of attacks to squares - // directly adjacent to the king of the given color. Pieces which attack - // more than one square are counted multiple times. For instance, if black's - // king is on g8 and there's a white knight on g5, this knight adds - // 2 to kingAdjacentZoneAttacksCount[BLACK]. - int kingAdjacentZoneAttacksCount[2]; -}; - +namespace Eval { -//// -//// Prototypes -//// +const Value Tempo = Value(17); // Must be visible to search -extern Value evaluate(const Position& pos, EvalInfo& ei); -extern void init_eval(int threads); -extern void quit_eval(); -extern void read_weights(Color sideToMove); +void init(); +Value evaluate(const Position& pos); +std::string trace(const Position& pos); +} -#endif // !defined(EVALUATE_H_INCLUDED) +#endif // #ifndef EVALUATE_H_INCLUDED