X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=inline;f=src%2Fevaluate.h;h=accb7d632a5694ba6c6be32d978f76dea41f40e4;hb=894c43a1d648d4cf160de006bde59aa5b6ba0190;hp=dcfa74e8f08638bd6a31c589465ca4b2a56e631f;hpb=e0e4bdc9918ac13d8a70058a9813349cb426936a;p=stockfish
diff --git a/src/evaluate.h b/src/evaluate.h
index dcfa74e8..accb7d63 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-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,94 +17,30 @@
along with this program. If not, see .
*/
-
#if !defined(EVALUATE_H_INCLUDED)
#define EVALUATE_H_INCLUDED
-////
-//// Includes
-////
-
-#include
-
-#include "material.h"
-#include "pawns.h"
-
+#include "misc.h"
+#include "types.h"
-////
-//// Types
-////
-
-
-/// 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 futilityMargin.
class Position;
-struct EvalInfo {
-
- EvalInfo() { kingDanger[0] = kingDanger[1] = Value(0); }
-
- // Middle game and endgame evaluations
- Score value;
+namespace Eval {
- // Pointers to material and pawn hash table entries
- MaterialInfo* mi;
- PawnInfo* pi;
+extern void init();
+extern Value evaluate(const Position& pos, Value& margin);
+extern std::string trace(const Position& pos);
- // 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];
- Bitboard attacked_by(Color c) const { return attackedBy[c][0]; }
- Bitboard attacked_by(Color c, PieceType pt) const { return attackedBy[c][pt]; }
+const int TableSize = 262144;
- // 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];
-
- // Middle game and endgame mobility scores
- Score mobility;
-
- // Value of the danger for the king of the given color
- Value kingDanger[2];
+struct Entry {
+ Key key;
+ Value value;
+ int16_t margins[2];
};
+struct Table : HashTable {};
-////
-//// Prototypes
-////
-
-extern Value evaluate(const Position& pos, EvalInfo& ei, int threadID);
-extern void init_eval(int threads);
-extern void quit_eval();
-extern void read_weights(Color sideToMove);
-
+}
#endif // !defined(EVALUATE_H_INCLUDED)