// KingAttackWeights array.
int kingAttackersWeight[COLOR_NB];
- // 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].
+ // kingAdjacentZoneAttacksCount[color] is the number of attacks by the given
+ // color to squares directly adjacent to the enemy king. Pieces which attack
+ // more than one square are counted multiple times. For instance, if there is
+ // a white knight on g5 and black's king is on g8, this white knight adds 2
+ // to kingAdjacentZoneAttacksCount[WHITE].
int kingAdjacentZoneAttacksCount[COLOR_NB];
Bitboard pinnedPieces[COLOR_NB];
namespace Tracing {
- enum Term { // First 8 entries are for PieceType
+ enum Terms { // First 8 entries are for PieceType
MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, TOTAL, TERMS_NB
};
Score scores[COLOR_NB][TERMS_NB];
-
- std::ostream& operator<<(std::ostream& os, Term idx);
+ EvalInfo ei;
+ ScaleFactor sf;
double to_cp(Value v);
void write(int idx, Color c, Score s);
void write(int idx, Score w, Score b = SCORE_ZERO);
+ void print(std::stringstream& ss, const char* name, int idx);
std::string do_trace(const Position& pos);
}
S( 25, 41), S( 25, 41), S(25, 41), S(25, 41) }
};
- // Outpost[Bishop/Knight][Square] contains bonuses for knights and bishops
- // outposts, indexed by piece type and square (from white's point of view).
+ // Outpost[PieceType][Square] contains bonuses for knights and bishops outposts,
+ // indexed by piece type and square (from white's point of view).
const Value Outpost[][SQUARE_NB] = {
{// A B C D E F G H
V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // Knights
// ThreatenedByPawn[PieceType] contains a penalty according to which piece
// type is attacked by an enemy pawn.
- const Score ThreatenedByPawn[PIECE_TYPE_NB] = {
- S(0, 0), S(0, 0), S(87, 118), S(84, 122), S(114, 203), S(121, 217)
+ const Score ThreatenedByPawn[] = {
+ S(0, 0), S(0, 0), S(107, 138), S(84, 122), S(114, 203), S(121, 217)
};
// Assorted bonuses and penalties used by evaluation
const Score Unstoppable = S( 0, 20);
const Score Hanging = S(31, 26);
const Score PawnAttackThreat = S(20, 20);
- const Score PawnSafePush = S( 5 , 5);
+ const Score PawnSafePush = S( 5, 5);
// Penalty for a bishop on a1/h1 (a8/h8 for black) which is trapped by
// a friendly pawn on b2/g2 (b7/g7 for black). This can obviously only
// by the space evaluation. In the middlegame, each side is given a bonus
// based on how many squares inside this area are safe and available for
// friendly minor pieces.
- const Bitboard SpaceMask[COLOR_NB] = {
+ const Bitboard SpaceMask[] = {
(FileCBB | FileDBB | FileEBB | FileFBB) & (Rank2BB | Rank3BB | Rank4BB),
(FileCBB | FileDBB | FileEBB | FileFBB) & (Rank7BB | Rank6BB | Rank5BB)
};
// index to KingDanger[].
//
// KingAttackWeights[PieceType] contains king attack weights by piece type
- const int KingAttackWeights[PIECE_TYPE_NB] = { 0, 0, 7, 5, 4, 1 };
+ const int KingAttackWeights[] = { 0, 0, 7, 5, 4, 1 };
// Bonuses for enemy's safe checks
const int QueenContactCheck = 89;
template<Color Us>
void init_eval_info(const Position& pos, EvalInfo& ei) {
- const Color Them = (Us == WHITE ? BLACK : WHITE);
+ const Color Them = (Us == WHITE ? BLACK : WHITE);
const Square Down = (Us == WHITE ? DELTA_S : DELTA_N);
ei.pinnedPieces[Us] = pos.pinned_pieces(Us);
- ei.attackedBy[Us][ALL_PIECES] = ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us);
+
Bitboard b = ei.attackedBy[Them][KING] = pos.attacks_from<KING>(pos.king_square(Them));
+ ei.attackedBy[Us][ALL_PIECES] = ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us);
// Init king safety tables only if we are going to use them
if (pos.non_pawn_material(Us) >= QueenValueMg)
// attacked and undefended squares around our king and the quality of
// the pawn shelter (current 'score' value).
attackUnits = std::min(74, ei.kingAttackersCount[Them] * ei.kingAttackersWeight[Them])
- + 8 * ei.kingAdjacentZoneAttacksCount[Them]
+ + 8 * ei.kingAdjacentZoneAttacksCount[Them]
+ 25 * popcount<Max15>(undefended)
- + 11 * (ei.pinnedPieces[Us] != 0)
- - mg_value(score) * 31 / 256
+ + 11 * (ei.pinnedPieces[Us] != 0)
+ - mg_value(score) / 8
- !pos.count<QUEEN>(Them) * 60;
// Analyse the enemy's safe queen contact checks. Firstly, find the
b &= ~pos.pieces()
& ~ei.attackedBy[Them][PAWN]
& (ei.attackedBy[Us][ALL_PIECES] | ~ei.attackedBy[Them][ALL_PIECES]);
-
+
if (b)
score += popcount<Full>(b) * PawnSafePush;
v /= int(PHASE_MIDGAME);
- // In case of tracing add all single evaluation terms for both white and black
+ // In case of tracing add all single evaluation contributions for both white and black
if (Trace)
{
Tracing::write(Tracing::MATERIAL, pos.psq_score());
Tracing::write(Tracing::SPACE, apply_weight(evaluate_space<WHITE>(pos, ei), Weights[Space])
, apply_weight(evaluate_space<BLACK>(pos, ei), Weights[Space]));
Tracing::write(Tracing::TOTAL, score);
+ Tracing::ei = ei;
+ Tracing::sf = sf;
}
return (pos.side_to_move() == WHITE ? v : -v) + Eval::Tempo;
}
- // Tracing functions
+ // Tracing function definitions
double Tracing::to_cp(Value v) { return double(v) / PawnValueEg; }
void Tracing::write(int idx, Color c, Score s) { scores[c][idx] = s; }
void Tracing::write(int idx, Score w, Score b) {
- scores[WHITE][idx] = w, scores[BLACK][idx] = b;
- }
- std::ostream& Tracing::operator<<(std::ostream& os, Term t) {
-
- double wScore[] = { to_cp(mg_value(scores[WHITE][t])), to_cp(eg_value(scores[WHITE][t])) };
- double bScore[] = { to_cp(mg_value(scores[BLACK][t])), to_cp(eg_value(scores[BLACK][t])) };
-
- if (t == MATERIAL || t == IMBALANCE || t == Term(PAWN) || t == TOTAL)
- os << " --- --- | --- --- | ";
- else
- os << std::setw(5) << wScore[MG] << " " << std::setw(5) << wScore[EG] << " | "
- << std::setw(5) << bScore[MG] << " " << std::setw(5) << bScore[EG] << " | ";
-
- os << std::setw(5) << wScore[MG] - bScore[MG] << " "
- << std::setw(5) << wScore[EG] - bScore[EG] << " \n";
+ write(idx, WHITE, w);
+ write(idx, BLACK, b);
+ }
- return os;
+ void Tracing::print(std::stringstream& ss, const char* name, int idx) {
+
+ Score wScore = scores[WHITE][idx];
+ Score bScore = scores[BLACK][idx];
+
+ switch (idx) {
+ case MATERIAL: case IMBALANCE: case PAWN: case TOTAL:
+ ss << std::setw(15) << name << " | --- --- | --- --- | "
+ << std::setw(5) << to_cp(mg_value(wScore - bScore)) << " "
+ << std::setw(5) << to_cp(eg_value(wScore - bScore)) << " \n";
+ break;
+ default:
+ ss << std::setw(15) << name << " | " << std::noshowpos
+ << std::setw(5) << to_cp(mg_value(wScore)) << " "
+ << std::setw(5) << to_cp(eg_value(wScore)) << " | "
+ << std::setw(5) << to_cp(mg_value(bScore)) << " "
+ << std::setw(5) << to_cp(eg_value(bScore)) << " | "
+ << std::setw(5) << to_cp(mg_value(wScore - bScore)) << " "
+ << std::setw(5) << to_cp(eg_value(wScore - bScore)) << " \n";
+ }
}
std::string Tracing::do_trace(const Position& pos) {
ss << std::showpoint << std::noshowpos << std::fixed << std::setprecision(2)
<< " Eval term | White | Black | Total \n"
<< " | MG EG | MG EG | MG EG \n"
- << "----------------+-------------+-------------+-------------\n"
- << " Material | " << Term(MATERIAL)
- << " Imbalance | " << Term(IMBALANCE)
- << " Pawns | " << Term(PAWN)
- << " Knights | " << Term(KNIGHT)
- << " Bishop | " << Term(BISHOP)
- << " Rooks | " << Term(ROOK)
- << " Queens | " << Term(QUEEN)
- << " Mobility | " << Term(MOBILITY)
- << " King safety | " << Term(KING)
- << " Threats | " << Term(THREAT)
- << " Passed pawns | " << Term(PASSED)
- << " Space | " << Term(SPACE)
- << "----------------+-------------+-------------+-------------\n"
- << " Total | " << Term(TOTAL);
+ << "----------------+-------------+-------------+-------------\n";
+
+ print(ss, "Material", MATERIAL);
+ print(ss, "Imbalance", IMBALANCE);
+ print(ss, "Pawns", PAWN);
+ print(ss, "Knights", KNIGHT);
+ print(ss, "Bishops", BISHOP);
+ print(ss, "Rooks", ROOK);
+ print(ss, "Queens", QUEEN);
+ print(ss, "Mobility", MOBILITY);
+ print(ss, "King safety", KING);
+ print(ss, "Threats", THREAT);
+ print(ss, "Passed pawns", PASSED);
+ print(ss, "Space", SPACE);
+
+ ss << "----------------+-------------+-------------+-------------\n";
+ print(ss, "Total", TOTAL);
ss << "\nTotal Evaluation: " << to_cp(v) << " (white side)\n";
void init() {
- const int MaxSlope = 87;
- const int Peak = 12800;
+ const int MaxSlope = 8700;
+ const int Peak = 1280000;
int t = 0;
for (int i = 0; i < 400; ++i)
{
- t = std::min(Peak, std::min(i * i * 27 / 100, t + MaxSlope));
- KingDanger[i] = apply_weight(make_score(t / 10, 0), Weights[KingSafety]);
+ t = std::min(Peak, std::min(i * i * 27, t + MaxSlope));
+ KingDanger[i] = apply_weight(make_score(t / 1000, 0), Weights[KingSafety]);
}
}
projects / stockfish / blobdiff