|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include <algorithm> |
|
#include <cassert> |
|
#include <cstdlib> |
|
#include <cstring> |
|
#include <fstream> |
|
#include <iomanip> |
|
#include <sstream> |
|
#include <iostream> |
|
#include <streambuf> |
|
#include <vector> |
|
|
|
#include "bitboard.h" |
|
#include "evaluate.h" |
|
#include "material.h" |
|
#include "misc.h" |
|
#include "pawns.h" |
|
#include "thread.h" |
|
#include "timeman.h" |
|
#include "uci.h" |
|
#include "incbin/incbin.h" |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#if !defined(_MSC_VER) && !defined(NNUE_EMBEDDING_OFF) |
|
INCBIN(EmbeddedNNUE, EvalFileDefaultName); |
|
#else |
|
const unsigned char gEmbeddedNNUEData[1] = {0x0}; |
|
const unsigned char *const gEmbeddedNNUEEnd = &gEmbeddedNNUEData[1]; |
|
const unsigned int gEmbeddedNNUESize = 1; |
|
#endif |
|
|
|
|
|
using namespace std; |
|
|
|
namespace Stockfish { |
|
|
|
namespace Eval { |
|
|
|
bool useNNUE; |
|
string currentEvalFileName = "None"; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void NNUE::init() { |
|
|
|
useNNUE = Options["Use NNUE"]; |
|
if (!useNNUE) |
|
return; |
|
|
|
string eval_file = string(Options["EvalFile"]); |
|
if (eval_file.empty()) |
|
eval_file = EvalFileDefaultName; |
|
|
|
#if defined(DEFAULT_NNUE_DIRECTORY) |
|
#define stringify2(x) #x |
|
#define stringify(x) stringify2(x) |
|
vector<string> dirs = { "<internal>" , "" , CommandLine::binaryDirectory , stringify(DEFAULT_NNUE_DIRECTORY) }; |
|
#else |
|
vector<string> dirs = { "<internal>" , "" , CommandLine::binaryDirectory }; |
|
#endif |
|
|
|
for (string directory : dirs) |
|
if (currentEvalFileName != eval_file) |
|
{ |
|
if (directory != "<internal>") |
|
{ |
|
ifstream stream(directory + eval_file, ios::binary); |
|
if (load_eval(eval_file, stream)) |
|
currentEvalFileName = eval_file; |
|
} |
|
|
|
if (directory == "<internal>" && eval_file == EvalFileDefaultName) |
|
{ |
|
|
|
class MemoryBuffer : public basic_streambuf<char> { |
|
public: MemoryBuffer(char* p, size_t n) { setg(p, p, p + n); setp(p, p + n); } |
|
}; |
|
|
|
MemoryBuffer buffer(const_cast<char*>(reinterpret_cast<const char*>(gEmbeddedNNUEData)), |
|
size_t(gEmbeddedNNUESize)); |
|
(void) gEmbeddedNNUEEnd; |
|
|
|
istream stream(&buffer); |
|
if (load_eval(eval_file, stream)) |
|
currentEvalFileName = eval_file; |
|
} |
|
} |
|
} |
|
|
|
|
|
void NNUE::verify() { |
|
|
|
string eval_file = string(Options["EvalFile"]); |
|
if (eval_file.empty()) |
|
eval_file = EvalFileDefaultName; |
|
|
|
if (useNNUE && currentEvalFileName != eval_file) |
|
{ |
|
|
|
string msg1 = "If the UCI option \"Use NNUE\" is set to true, network evaluation parameters compatible with the engine must be available."; |
|
string msg2 = "The option is set to true, but the network file " + eval_file + " was not loaded successfully."; |
|
string msg3 = "The UCI option EvalFile might need to specify the full path, including the directory name, to the network file."; |
|
string msg4 = "The default net can be downloaded from: https://tests.stockfishchess.org/api/nn/" + std::string(EvalFileDefaultName); |
|
string msg5 = "The engine will be terminated now."; |
|
|
|
sync_cout << "info string ERROR: " << msg1 << sync_endl; |
|
sync_cout << "info string ERROR: " << msg2 << sync_endl; |
|
sync_cout << "info string ERROR: " << msg3 << sync_endl; |
|
sync_cout << "info string ERROR: " << msg4 << sync_endl; |
|
sync_cout << "info string ERROR: " << msg5 << sync_endl; |
|
|
|
exit(EXIT_FAILURE); |
|
} |
|
|
|
if (useNNUE) |
|
sync_cout << "info string NNUE evaluation using " << eval_file << " enabled" << sync_endl; |
|
else |
|
sync_cout << "info string classical evaluation enabled" << sync_endl; |
|
} |
|
} |
|
|
|
namespace Trace { |
|
|
|
enum Tracing { NO_TRACE, TRACE }; |
|
|
|
enum Term { |
|
MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, WINNABLE, TOTAL, TERM_NB |
|
}; |
|
|
|
Score scores[TERM_NB][COLOR_NB]; |
|
|
|
double to_cp(Value v) { return double(v) / UCI::NormalizeToPawnValue; } |
|
|
|
void add(int idx, Color c, Score s) { |
|
scores[idx][c] = s; |
|
} |
|
|
|
void add(int idx, Score w, Score b = SCORE_ZERO) { |
|
scores[idx][WHITE] = w; |
|
scores[idx][BLACK] = b; |
|
} |
|
|
|
std::ostream& operator<<(std::ostream& os, Score s) { |
|
os << std::setw(5) << to_cp(mg_value(s)) << " " |
|
<< std::setw(5) << to_cp(eg_value(s)); |
|
return os; |
|
} |
|
|
|
std::ostream& operator<<(std::ostream& os, Term t) { |
|
|
|
if (t == MATERIAL || t == IMBALANCE || t == WINNABLE || t == TOTAL) |
|
os << " ---- ----" << " | " << " ---- ----"; |
|
else |
|
os << scores[t][WHITE] << " | " << scores[t][BLACK]; |
|
|
|
os << " | " << scores[t][WHITE] - scores[t][BLACK] << " |\n"; |
|
return os; |
|
} |
|
} |
|
|
|
using namespace Trace; |
|
|
|
namespace { |
|
|
|
|
|
constexpr Value LazyThreshold1 = Value(3631); |
|
constexpr Value LazyThreshold2 = Value(2084); |
|
constexpr Value SpaceThreshold = Value(11551); |
|
|
|
|
|
constexpr int KingAttackWeights[PIECE_TYPE_NB] = { 0, 0, 76, 46, 45, 14 }; |
|
|
|
|
|
|
|
constexpr int SafeCheck[][2] = { |
|
{}, {}, {805, 1292}, {650, 984}, {1071, 1886}, {730, 1128} |
|
}; |
|
|
|
#define S(mg, eg) make_score(mg, eg) |
|
|
|
|
|
|
|
constexpr Score MobilityBonus[][32] = { |
|
{ S(-62,-79), S(-53,-57), S(-12,-31), S( -3,-17), S( 3, 7), S( 12, 13), |
|
S( 21, 16), S( 28, 21), S( 37, 26) }, |
|
{ S(-47,-59), S(-20,-25), S( 14, -8), S( 29, 12), S( 39, 21), S( 53, 40), |
|
S( 53, 56), S( 60, 58), S( 62, 65), S( 69, 72), S( 78, 78), S( 83, 87), |
|
S( 91, 88), S( 96, 98) }, |
|
{ S(-60,-82), S(-24,-15), S( 0, 17) ,S( 3, 43), S( 4, 72), S( 14,100), |
|
S( 20,102), S( 30,122), S( 41,133), S(41 ,139), S( 41,153), S( 45,160), |
|
S( 57,165), S( 58,170), S( 67,175) }, |
|
{ S(-29,-49), S(-16,-29), S( -8, -8), S( -8, 17), S( 18, 39), S( 25, 54), |
|
S( 23, 59), S( 37, 73), S( 41, 76), S( 54, 95), S( 65, 95) ,S( 68,101), |
|
S( 69,124), S( 70,128), S( 70,132), S( 70,133) ,S( 71,136), S( 72,140), |
|
S( 74,147), S( 76,149), S( 90,153), S(104,169), S(105,171), S(106,171), |
|
S(112,178), S(114,185), S(114,187), S(119,221) } |
|
}; |
|
|
|
|
|
|
|
constexpr Score BishopPawns[int(FILE_NB) / 2] = { |
|
S(3, 8), S(3, 9), S(2, 7), S(3, 7) |
|
}; |
|
|
|
|
|
constexpr Score KingProtector[] = { S(9, 9), S(7, 9) }; |
|
|
|
|
|
|
|
constexpr Score Outpost[] = { S(54, 34), S(31, 25) }; |
|
|
|
|
|
constexpr Score PassedRank[RANK_NB] = { |
|
S(0, 0), S(2, 38), S(15, 36), S(22, 50), S(64, 81), S(166, 184), S(284, 269) |
|
}; |
|
|
|
constexpr Score RookOnClosedFile = S(10, 5); |
|
constexpr Score RookOnOpenFile[] = { S(18, 8), S(49, 26) }; |
|
|
|
|
|
|
|
|
|
constexpr Score ThreatByMinor[PIECE_TYPE_NB] = { |
|
S(0, 0), S(6, 37), S(64, 50), S(82, 57), S(103, 130), S(81, 163) |
|
}; |
|
|
|
constexpr Score ThreatByRook[PIECE_TYPE_NB] = { |
|
S(0, 0), S(3, 44), S(36, 71), S(44, 59), S(0, 39), S(60, 39) |
|
}; |
|
|
|
constexpr Value CorneredBishop = Value(50); |
|
|
|
|
|
constexpr Score UncontestedOutpost = S( 0, 10); |
|
constexpr Score BishopOnKingRing = S( 24, 0); |
|
constexpr Score BishopXRayPawns = S( 4, 5); |
|
constexpr Score FlankAttacks = S( 8, 0); |
|
constexpr Score Hanging = S( 72, 40); |
|
constexpr Score KnightOnQueen = S( 16, 11); |
|
constexpr Score LongDiagonalBishop = S( 45, 0); |
|
constexpr Score MinorBehindPawn = S( 18, 3); |
|
constexpr Score PassedFile = S( 13, 8); |
|
constexpr Score PawnlessFlank = S( 19, 97); |
|
constexpr Score ReachableOutpost = S( 33, 19); |
|
constexpr Score RestrictedPiece = S( 6, 7); |
|
constexpr Score RookOnKingRing = S( 16, 0); |
|
constexpr Score SliderOnQueen = S( 62, 21); |
|
constexpr Score ThreatByKing = S( 24, 87); |
|
constexpr Score ThreatByPawnPush = S( 48, 39); |
|
constexpr Score ThreatBySafePawn = S(167, 99); |
|
constexpr Score TrappedRook = S( 55, 13); |
|
constexpr Score WeakQueenProtection = S( 14, 0); |
|
constexpr Score WeakQueen = S( 57, 19); |
|
|
|
|
|
#undef S |
|
|
|
|
|
template<Tracing T> |
|
class Evaluation { |
|
|
|
public: |
|
Evaluation() = delete; |
|
explicit Evaluation(const Position& p) : pos(p) {} |
|
Evaluation& operator=(const Evaluation&) = delete; |
|
Value value(); |
|
|
|
private: |
|
template<Color Us> void initialize(); |
|
template<Color Us, PieceType Pt> Score pieces(); |
|
template<Color Us> Score king() const; |
|
template<Color Us> Score threats() const; |
|
template<Color Us> Score passed() const; |
|
template<Color Us> Score space() const; |
|
Value winnable(Score score) const; |
|
|
|
const Position& pos; |
|
Material::Entry* me; |
|
Pawns::Entry* pe; |
|
Bitboard mobilityArea[COLOR_NB]; |
|
Score mobility[COLOR_NB] = { SCORE_ZERO, SCORE_ZERO }; |
|
|
|
|
|
|
|
|
|
Bitboard attackedBy[COLOR_NB][PIECE_TYPE_NB]; |
|
|
|
|
|
|
|
Bitboard attackedBy2[COLOR_NB]; |
|
|
|
|
|
|
|
Bitboard kingRing[COLOR_NB]; |
|
|
|
|
|
|
|
int kingAttackersCount[COLOR_NB]; |
|
|
|
|
|
|
|
|
|
|
|
int kingAttackersWeight[COLOR_NB]; |
|
|
|
|
|
|
|
|
|
|
|
|
|
int kingAttacksCount[COLOR_NB]; |
|
}; |
|
|
|
|
|
|
|
|
|
|
|
template<Tracing T> template<Color Us> |
|
void Evaluation<T>::initialize() { |
|
|
|
constexpr Color Them = ~Us; |
|
constexpr Direction Up = pawn_push(Us); |
|
constexpr Direction Down = -Up; |
|
constexpr Bitboard LowRanks = (Us == WHITE ? Rank2BB | Rank3BB : Rank7BB | Rank6BB); |
|
|
|
const Square ksq = pos.square<KING>(Us); |
|
|
|
Bitboard dblAttackByPawn = pawn_double_attacks_bb<Us>(pos.pieces(Us, PAWN)); |
|
|
|
|
|
Bitboard b = pos.pieces(Us, PAWN) & (shift<Down>(pos.pieces()) | LowRanks); |
|
|
|
|
|
|
|
mobilityArea[Us] = ~(b | pos.pieces(Us, KING, QUEEN) | pos.blockers_for_king(Us) | pe->pawn_attacks(Them)); |
|
|
|
|
|
attackedBy[Us][KING] = attacks_bb<KING>(ksq); |
|
attackedBy[Us][PAWN] = pe->pawn_attacks(Us); |
|
attackedBy[Us][ALL_PIECES] = attackedBy[Us][KING] | attackedBy[Us][PAWN]; |
|
attackedBy2[Us] = dblAttackByPawn | (attackedBy[Us][KING] & attackedBy[Us][PAWN]); |
|
|
|
|
|
Square s = make_square(std::clamp(file_of(ksq), FILE_B, FILE_G), |
|
std::clamp(rank_of(ksq), RANK_2, RANK_7)); |
|
kingRing[Us] = attacks_bb<KING>(s) | s; |
|
|
|
kingAttackersCount[Them] = popcount(kingRing[Us] & pe->pawn_attacks(Them)); |
|
kingAttacksCount[Them] = kingAttackersWeight[Them] = 0; |
|
|
|
|
|
kingRing[Us] &= ~dblAttackByPawn; |
|
} |
|
|
|
|
|
|
|
|
|
template<Tracing T> template<Color Us, PieceType Pt> |
|
Score Evaluation<T>::pieces() { |
|
|
|
constexpr Color Them = ~Us; |
|
constexpr Direction Down = -pawn_push(Us); |
|
constexpr Bitboard OutpostRanks = (Us == WHITE ? Rank4BB | Rank5BB | Rank6BB |
|
: Rank5BB | Rank4BB | Rank3BB); |
|
Bitboard b1 = pos.pieces(Us, Pt); |
|
Bitboard b, bb; |
|
Score score = SCORE_ZERO; |
|
|
|
attackedBy[Us][Pt] = 0; |
|
|
|
while (b1) |
|
{ |
|
Square s = pop_lsb(b1); |
|
|
|
|
|
b = Pt == BISHOP ? attacks_bb<BISHOP>(s, pos.pieces() ^ pos.pieces(QUEEN)) |
|
: Pt == ROOK ? attacks_bb< ROOK>(s, pos.pieces() ^ pos.pieces(QUEEN) ^ pos.pieces(Us, ROOK)) |
|
: attacks_bb<Pt>(s, pos.pieces()); |
|
|
|
if (pos.blockers_for_king(Us) & s) |
|
b &= line_bb(pos.square<KING>(Us), s); |
|
|
|
attackedBy2[Us] |= attackedBy[Us][ALL_PIECES] & b; |
|
attackedBy[Us][Pt] |= b; |
|
attackedBy[Us][ALL_PIECES] |= b; |
|
|
|
if (b & kingRing[Them]) |
|
{ |
|
kingAttackersCount[Us]++; |
|
kingAttackersWeight[Us] += KingAttackWeights[Pt]; |
|
kingAttacksCount[Us] += popcount(b & attackedBy[Them][KING]); |
|
} |
|
|
|
else if (Pt == ROOK && (file_bb(s) & kingRing[Them])) |
|
score += RookOnKingRing; |
|
|
|
else if (Pt == BISHOP && (attacks_bb<BISHOP>(s, pos.pieces(PAWN)) & kingRing[Them])) |
|
score += BishopOnKingRing; |
|
|
|
int mob = popcount(b & mobilityArea[Us]); |
|
mobility[Us] += MobilityBonus[Pt - 2][mob]; |
|
|
|
if (Pt == BISHOP || Pt == KNIGHT) |
|
{ |
|
|
|
|
|
bb = OutpostRanks & (attackedBy[Us][PAWN] | shift<Down>(pos.pieces(PAWN))) |
|
& ~pe->pawn_attacks_span(Them); |
|
Bitboard targets = pos.pieces(Them) & ~pos.pieces(PAWN); |
|
|
|
if ( Pt == KNIGHT |
|
&& bb & s & ~CenterFiles |
|
&& !(b & targets) |
|
&& (!more_than_one(targets & (s & QueenSide ? QueenSide : KingSide)))) |
|
score += UncontestedOutpost * popcount(pos.pieces(PAWN) & (s & QueenSide ? QueenSide : KingSide)); |
|
else if (bb & s) |
|
score += Outpost[Pt == BISHOP]; |
|
else if (Pt == KNIGHT && bb & b & ~pos.pieces(Us)) |
|
score += ReachableOutpost; |
|
|
|
|
|
if (shift<Down>(pos.pieces(PAWN)) & s) |
|
score += MinorBehindPawn; |
|
|
|
|
|
score -= KingProtector[Pt == BISHOP] * distance(pos.square<KING>(Us), s); |
|
|
|
if constexpr (Pt == BISHOP) |
|
{ |
|
|
|
|
|
|
|
Bitboard blocked = pos.pieces(Us, PAWN) & shift<Down>(pos.pieces()); |
|
|
|
score -= BishopPawns[edge_distance(file_of(s))] * pos.pawns_on_same_color_squares(Us, s) |
|
* (!(attackedBy[Us][PAWN] & s) + popcount(blocked & CenterFiles)); |
|
|
|
|
|
score -= BishopXRayPawns * popcount(attacks_bb<BISHOP>(s) & pos.pieces(Them, PAWN)); |
|
|
|
|
|
if (more_than_one(attacks_bb<BISHOP>(s, pos.pieces(PAWN)) & Center)) |
|
score += LongDiagonalBishop; |
|
|
|
|
|
|
|
|
|
if ( pos.is_chess960() |
|
&& (s == relative_square(Us, SQ_A1) || s == relative_square(Us, SQ_H1))) |
|
{ |
|
Direction d = pawn_push(Us) + (file_of(s) == FILE_A ? EAST : WEST); |
|
if (pos.piece_on(s + d) == make_piece(Us, PAWN)) |
|
score -= !pos.empty(s + d + pawn_push(Us)) ? 4 * make_score(CorneredBishop, CorneredBishop) |
|
: 3 * make_score(CorneredBishop, CorneredBishop); |
|
} |
|
} |
|
} |
|
|
|
if constexpr (Pt == ROOK) |
|
{ |
|
|
|
if (pos.is_on_semiopen_file(Us, s)) |
|
{ |
|
score += RookOnOpenFile[pos.is_on_semiopen_file(Them, s)]; |
|
} |
|
else |
|
{ |
|
|
|
if ( pos.pieces(Us, PAWN) |
|
& shift<Down>(pos.pieces()) |
|
& file_bb(s)) |
|
{ |
|
score -= RookOnClosedFile; |
|
} |
|
|
|
|
|
if (mob <= 3) |
|
{ |
|
File kf = file_of(pos.square<KING>(Us)); |
|
if ((kf < FILE_E) == (file_of(s) < kf)) |
|
score -= TrappedRook * (1 + !pos.castling_rights(Us)); |
|
} |
|
} |
|
} |
|
|
|
if constexpr (Pt == QUEEN) |
|
{ |
|
|
|
Bitboard queenPinners; |
|
if (pos.slider_blockers(pos.pieces(Them, ROOK, BISHOP), s, queenPinners)) |
|
score -= WeakQueen; |
|
} |
|
} |
|
if constexpr (T) |
|
Trace::add(Pt, Us, score); |
|
|
|
return score; |
|
} |
|
|
|
|
|
|
|
|
|
template<Tracing T> template<Color Us> |
|
Score Evaluation<T>::king() const { |
|
|
|
constexpr Color Them = ~Us; |
|
constexpr Bitboard Camp = (Us == WHITE ? AllSquares ^ Rank6BB ^ Rank7BB ^ Rank8BB |
|
: AllSquares ^ Rank1BB ^ Rank2BB ^ Rank3BB); |
|
|
|
Bitboard weak, b1, b2, b3, safe, unsafeChecks = 0; |
|
Bitboard rookChecks, queenChecks, bishopChecks, knightChecks; |
|
int kingDanger = 0; |
|
const Square ksq = pos.square<KING>(Us); |
|
|
|
|
|
Score score = pe->king_safety<Us>(pos); |
|
|
|
|
|
weak = attackedBy[Them][ALL_PIECES] |
|
& ~attackedBy2[Us] |
|
& (~attackedBy[Us][ALL_PIECES] | attackedBy[Us][KING] | attackedBy[Us][QUEEN]); |
|
|
|
|
|
safe = ~pos.pieces(Them); |
|
safe &= ~attackedBy[Us][ALL_PIECES] | (weak & attackedBy2[Them]); |
|
|
|
b1 = attacks_bb<ROOK >(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN)); |
|
b2 = attacks_bb<BISHOP>(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN)); |
|
|
|
|
|
rookChecks = b1 & attackedBy[Them][ROOK] & safe; |
|
if (rookChecks) |
|
kingDanger += SafeCheck[ROOK][more_than_one(rookChecks)]; |
|
else |
|
unsafeChecks |= b1 & attackedBy[Them][ROOK]; |
|
|
|
|
|
|
|
queenChecks = (b1 | b2) & attackedBy[Them][QUEEN] & safe |
|
& ~(attackedBy[Us][QUEEN] | rookChecks); |
|
if (queenChecks) |
|
kingDanger += SafeCheck[QUEEN][more_than_one(queenChecks)]; |
|
|
|
|
|
|
|
bishopChecks = b2 & attackedBy[Them][BISHOP] & safe |
|
& ~queenChecks; |
|
if (bishopChecks) |
|
kingDanger += SafeCheck[BISHOP][more_than_one(bishopChecks)]; |
|
|
|
else |
|
unsafeChecks |= b2 & attackedBy[Them][BISHOP]; |
|
|
|
|
|
knightChecks = attacks_bb<KNIGHT>(ksq) & attackedBy[Them][KNIGHT]; |
|
if (knightChecks & safe) |
|
kingDanger += SafeCheck[KNIGHT][more_than_one(knightChecks & safe)]; |
|
else |
|
unsafeChecks |= knightChecks; |
|
|
|
|
|
|
|
b1 = attackedBy[Them][ALL_PIECES] & KingFlank[file_of(ksq)] & Camp; |
|
b2 = b1 & attackedBy2[Them]; |
|
b3 = attackedBy[Us][ALL_PIECES] & KingFlank[file_of(ksq)] & Camp; |
|
|
|
int kingFlankAttack = popcount(b1) + popcount(b2); |
|
int kingFlankDefense = popcount(b3); |
|
|
|
kingDanger += kingAttackersCount[Them] * kingAttackersWeight[Them] |
|
+ 183 * popcount(kingRing[Us] & weak) |
|
+ 148 * popcount(unsafeChecks) |
|
+ 98 * popcount(pos.blockers_for_king(Us)) |
|
+ 69 * kingAttacksCount[Them] |
|
+ 3 * kingFlankAttack * kingFlankAttack / 8 |
|
+ mg_value(mobility[Them] - mobility[Us]) |
|
- 873 * !pos.count<QUEEN>(Them) |
|
- 100 * bool(attackedBy[Us][KNIGHT] & attackedBy[Us][KING]) |
|
- 6 * mg_value(score) / 8 |
|
- 4 * kingFlankDefense |
|
+ 37; |
|
|
|
|
|
if (kingDanger > 100) |
|
score -= make_score(kingDanger * kingDanger / 4096, kingDanger / 16); |
|
|
|
|
|
if (!(pos.pieces(PAWN) & KingFlank[file_of(ksq)])) |
|
score -= PawnlessFlank; |
|
|
|
|
|
score -= FlankAttacks * kingFlankAttack; |
|
|
|
if constexpr (T) |
|
Trace::add(KING, Us, score); |
|
|
|
return score; |
|
} |
|
|
|
|
|
|
|
|
|
|
|
template<Tracing T> template<Color Us> |
|
Score Evaluation<T>::threats() const { |
|
|
|
constexpr Color Them = ~Us; |
|
constexpr Direction Up = pawn_push(Us); |
|
constexpr Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB); |
|
|
|
Bitboard b, weak, defended, nonPawnEnemies, stronglyProtected, safe; |
|
Score score = SCORE_ZERO; |
|
|
|
|
|
nonPawnEnemies = pos.pieces(Them) & ~pos.pieces(PAWN); |
|
|
|
|
|
|
|
stronglyProtected = attackedBy[Them][PAWN] |
|
| (attackedBy2[Them] & ~attackedBy2[Us]); |
|
|
|
|
|
defended = nonPawnEnemies & stronglyProtected; |
|
|
|
|
|
weak = pos.pieces(Them) & ~stronglyProtected & attackedBy[Us][ALL_PIECES]; |
|
|
|
|
|
if (defended | weak) |
|
{ |
|
b = (defended | weak) & (attackedBy[Us][KNIGHT] | attackedBy[Us][BISHOP]); |
|
while (b) |
|
score += ThreatByMinor[type_of(pos.piece_on(pop_lsb(b)))]; |
|
|
|
b = weak & attackedBy[Us][ROOK]; |
|
while (b) |
|
score += ThreatByRook[type_of(pos.piece_on(pop_lsb(b)))]; |
|
|
|
if (weak & attackedBy[Us][KING]) |
|
score += ThreatByKing; |
|
|
|
b = ~attackedBy[Them][ALL_PIECES] |
|
| (nonPawnEnemies & attackedBy2[Us]); |
|
score += Hanging * popcount(weak & b); |
|
|
|
|
|
score += WeakQueenProtection * popcount(weak & attackedBy[Them][QUEEN]); |
|
} |
|
|
|
|
|
b = attackedBy[Them][ALL_PIECES] |
|
& ~stronglyProtected |
|
& attackedBy[Us][ALL_PIECES]; |
|
score += RestrictedPiece * popcount(b); |
|
|
|
|
|
safe = ~attackedBy[Them][ALL_PIECES] | attackedBy[Us][ALL_PIECES]; |
|
|
|
|
|
b = pos.pieces(Us, PAWN) & safe; |
|
b = pawn_attacks_bb<Us>(b) & nonPawnEnemies; |
|
score += ThreatBySafePawn * popcount(b); |
|
|
|
|
|
b = shift<Up>(pos.pieces(Us, PAWN)) & ~pos.pieces(); |
|
b |= shift<Up>(b & TRank3BB) & ~pos.pieces(); |
|
|
|
|
|
b &= ~attackedBy[Them][PAWN] & safe; |
|
|
|
|
|
b = pawn_attacks_bb<Us>(b) & nonPawnEnemies; |
|
score += ThreatByPawnPush * popcount(b); |
|
|
|
|
|
if (pos.count<QUEEN>(Them) == 1) |
|
{ |
|
bool queenImbalance = pos.count<QUEEN>() == 1; |
|
|
|
Square s = pos.square<QUEEN>(Them); |
|
safe = mobilityArea[Us] |
|
& ~pos.pieces(Us, PAWN) |
|
& ~stronglyProtected; |
|
|
|
b = attackedBy[Us][KNIGHT] & attacks_bb<KNIGHT>(s); |
|
|
|
score += KnightOnQueen * popcount(b & safe) * (1 + queenImbalance); |
|
|
|
b = (attackedBy[Us][BISHOP] & attacks_bb<BISHOP>(s, pos.pieces())) |
|
| (attackedBy[Us][ROOK ] & attacks_bb<ROOK >(s, pos.pieces())); |
|
|
|
score += SliderOnQueen * popcount(b & safe & attackedBy2[Us]) * (1 + queenImbalance); |
|
} |
|
|
|
if constexpr (T) |
|
Trace::add(THREAT, Us, score); |
|
|
|
return score; |
|
} |
|
|
|
|
|
|
|
|
|
template<Tracing T> template<Color Us> |
|
Score Evaluation<T>::passed() const { |
|
|
|
constexpr Color Them = ~Us; |
|
constexpr Direction Up = pawn_push(Us); |
|
constexpr Direction Down = -Up; |
|
|
|
auto king_proximity = [&](Color c, Square s) { |
|
return std::min(distance(pos.square<KING>(c), s), 5); |
|
}; |
|
|
|
Bitboard b, bb, squaresToQueen, unsafeSquares, blockedPassers, helpers; |
|
Score score = SCORE_ZERO; |
|
|
|
b = pe->passed_pawns(Us); |
|
|
|
blockedPassers = b & shift<Down>(pos.pieces(Them, PAWN)); |
|
if (blockedPassers) |
|
{ |
|
helpers = shift<Up>(pos.pieces(Us, PAWN)) |
|
& ~pos.pieces(Them) |
|
& (~attackedBy2[Them] | attackedBy[Us][ALL_PIECES]); |
|
|
|
|
|
b &= ~blockedPassers |
|
| shift<WEST>(helpers) |
|
| shift<EAST>(helpers); |
|
} |
|
|
|
while (b) |
|
{ |
|
Square s = pop_lsb(b); |
|
|
|
assert(!(pos.pieces(Them, PAWN) & forward_file_bb(Us, s + Up))); |
|
|
|
int r = relative_rank(Us, s); |
|
|
|
Score bonus = PassedRank[r]; |
|
|
|
if (r > RANK_3) |
|
{ |
|
int w = 5 * r - 13; |
|
Square blockSq = s + Up; |
|
|
|
|
|
bonus += make_score(0, ( king_proximity(Them, blockSq) * 19 / 4 |
|
- king_proximity(Us, blockSq) * 2) * w); |
|
|
|
|
|
if (r != RANK_7) |
|
bonus -= make_score(0, king_proximity(Us, blockSq + Up) * w); |
|
|
|
|
|
if (pos.empty(blockSq)) |
|
{ |
|
squaresToQueen = forward_file_bb(Us, s); |
|
unsafeSquares = passed_pawn_span(Us, s); |
|
|
|
bb = forward_file_bb(Them, s) & pos.pieces(ROOK, QUEEN); |
|
|
|
if (!(pos.pieces(Them) & bb)) |
|
unsafeSquares &= attackedBy[Them][ALL_PIECES] | pos.pieces(Them); |
|
|
|
|
|
|
|
|
|
|
|
int k = !unsafeSquares ? 36 : |
|
!(unsafeSquares & ~attackedBy[Us][PAWN]) ? 30 : |
|
!(unsafeSquares & squaresToQueen) ? 17 : |
|
!(unsafeSquares & blockSq) ? 7 : |
|
0 ; |
|
|
|
|
|
if ((pos.pieces(Us) & bb) || (attackedBy[Us][ALL_PIECES] & blockSq)) |
|
k += 5; |
|
|
|
bonus += make_score(k * w, k * w); |
|
} |
|
} |
|
|
|
score += bonus - PassedFile * edge_distance(file_of(s)); |
|
} |
|
|
|
if constexpr (T) |
|
Trace::add(PASSED, Us, score); |
|
|
|
return score; |
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template<Tracing T> template<Color Us> |
|
Score Evaluation<T>::space() const { |
|
|
|
|
|
if (pos.non_pawn_material() < SpaceThreshold) |
|
return SCORE_ZERO; |
|
|
|
constexpr Color Them = ~Us; |
|
constexpr Direction Down = -pawn_push(Us); |
|
constexpr Bitboard SpaceMask = |
|
Us == WHITE ? CenterFiles & (Rank2BB | Rank3BB | Rank4BB) |
|
: CenterFiles & (Rank7BB | Rank6BB | Rank5BB); |
|
|
|
|
|
Bitboard safe = SpaceMask |
|
& ~pos.pieces(Us, PAWN) |
|
& ~attackedBy[Them][PAWN]; |
|
|
|
|
|
Bitboard behind = pos.pieces(Us, PAWN); |
|
behind |= shift<Down>(behind); |
|
behind |= shift<Down+Down>(behind); |
|
|
|
|
|
|
|
int bonus = popcount(safe) + popcount(behind & safe & ~attackedBy[Them][ALL_PIECES]); |
|
int weight = pos.count<ALL_PIECES>(Us) - 3 + std::min(pe->blocked_count(), 9); |
|
Score score = make_score(bonus * weight * weight / 16, 0); |
|
|
|
if constexpr (T) |
|
Trace::add(SPACE, Us, score); |
|
|
|
return score; |
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
template<Tracing T> |
|
Value Evaluation<T>::winnable(Score score) const { |
|
|
|
int outflanking = distance<File>(pos.square<KING>(WHITE), pos.square<KING>(BLACK)) |
|
+ int(rank_of(pos.square<KING>(WHITE)) - rank_of(pos.square<KING>(BLACK))); |
|
|
|
bool pawnsOnBothFlanks = (pos.pieces(PAWN) & QueenSide) |
|
&& (pos.pieces(PAWN) & KingSide); |
|
|
|
bool almostUnwinnable = outflanking < 0 |
|
&& !pawnsOnBothFlanks; |
|
|
|
bool infiltration = rank_of(pos.square<KING>(WHITE)) > RANK_4 |
|
|| rank_of(pos.square<KING>(BLACK)) < RANK_5; |
|
|
|
|
|
int complexity = 9 * pe->passed_count() |
|
+ 12 * pos.count<PAWN>() |
|
+ 9 * outflanking |
|
+ 21 * pawnsOnBothFlanks |
|
+ 24 * infiltration |
|
+ 51 * !pos.non_pawn_material() |
|
- 43 * almostUnwinnable |
|
-110 ; |
|
|
|
Value mg = mg_value(score); |
|
Value eg = eg_value(score); |
|
|
|
|
|
|
|
|
|
int u = ((mg > 0) - (mg < 0)) * std::clamp(complexity + 50, -abs(mg), 0); |
|
int v = ((eg > 0) - (eg < 0)) * std::max(complexity, -abs(eg)); |
|
|
|
mg += u; |
|
eg += v; |
|
|
|
|
|
Color strongSide = eg > VALUE_DRAW ? WHITE : BLACK; |
|
int sf = me->scale_factor(pos, strongSide); |
|
|
|
|
|
if (sf == SCALE_FACTOR_NORMAL) |
|
{ |
|
if (pos.opposite_bishops()) |
|
{ |
|
|
|
|
|
if ( pos.non_pawn_material(WHITE) == BishopValueMg |
|
&& pos.non_pawn_material(BLACK) == BishopValueMg) |
|
sf = 18 + 4 * popcount(pe->passed_pawns(strongSide)); |
|
|
|
|
|
else |
|
sf = 22 + 3 * pos.count<ALL_PIECES>(strongSide); |
|
} |
|
|
|
|
|
|
|
else if ( pos.non_pawn_material(WHITE) == RookValueMg |
|
&& pos.non_pawn_material(BLACK) == RookValueMg |
|
&& pos.count<PAWN>(strongSide) - pos.count<PAWN>(~strongSide) <= 1 |
|
&& bool(KingSide & pos.pieces(strongSide, PAWN)) != bool(QueenSide & pos.pieces(strongSide, PAWN)) |
|
&& (attacks_bb<KING>(pos.square<KING>(~strongSide)) & pos.pieces(~strongSide, PAWN))) |
|
sf = 36; |
|
|
|
|
|
else if (pos.count<QUEEN>() == 1) |
|
sf = 37 + 3 * (pos.count<QUEEN>(WHITE) == 1 ? pos.count<BISHOP>(BLACK) + pos.count<KNIGHT>(BLACK) |
|
: pos.count<BISHOP>(WHITE) + pos.count<KNIGHT>(WHITE)); |
|
|
|
|
|
else |
|
sf = std::min(sf, 36 + 7 * pos.count<PAWN>(strongSide)) - 4 * !pawnsOnBothFlanks; |
|
|
|
|
|
sf -= 4 * !pawnsOnBothFlanks; |
|
} |
|
|
|
|
|
v = mg * int(me->game_phase()) |
|
+ eg * int(PHASE_MIDGAME - me->game_phase()) * ScaleFactor(sf) / SCALE_FACTOR_NORMAL; |
|
v /= PHASE_MIDGAME; |
|
|
|
if constexpr (T) |
|
{ |
|
Trace::add(WINNABLE, make_score(u, eg * ScaleFactor(sf) / SCALE_FACTOR_NORMAL - eg_value(score))); |
|
Trace::add(TOTAL, make_score(mg, eg * ScaleFactor(sf) / SCALE_FACTOR_NORMAL)); |
|
} |
|
|
|
return Value(v); |
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
template<Tracing T> |
|
Value Evaluation<T>::value() { |
|
|
|
assert(!pos.checkers()); |
|
|
|
|
|
me = Material::probe(pos); |
|
|
|
|
|
|
|
if (me->specialized_eval_exists()) |
|
return me->evaluate(pos); |
|
|
|
|
|
|
|
|
|
Score score = pos.psq_score() + me->imbalance(); |
|
|
|
|
|
pe = Pawns::probe(pos); |
|
score += pe->pawn_score(WHITE) - pe->pawn_score(BLACK); |
|
|
|
|
|
auto lazy_skip = [&](Value lazyThreshold) { |
|
return abs(mg_value(score) + eg_value(score)) > lazyThreshold |
|
+ std::abs(pos.this_thread()->bestValue) * 5 / 4 |
|
+ pos.non_pawn_material() / 32; |
|
}; |
|
|
|
if (lazy_skip(LazyThreshold1)) |
|
goto make_v; |
|
|
|
|
|
initialize<WHITE>(); |
|
initialize<BLACK>(); |
|
|
|
|
|
|
|
score += pieces<WHITE, KNIGHT>() - pieces<BLACK, KNIGHT>() |
|
+ pieces<WHITE, BISHOP>() - pieces<BLACK, BISHOP>() |
|
+ pieces<WHITE, ROOK >() - pieces<BLACK, ROOK >() |
|
+ pieces<WHITE, QUEEN >() - pieces<BLACK, QUEEN >(); |
|
|
|
score += mobility[WHITE] - mobility[BLACK]; |
|
|
|
|
|
score += king< WHITE>() - king< BLACK>() |
|
+ passed< WHITE>() - passed< BLACK>(); |
|
|
|
if (lazy_skip(LazyThreshold2)) |
|
goto make_v; |
|
|
|
score += threats<WHITE>() - threats<BLACK>() |
|
+ space< WHITE>() - space< BLACK>(); |
|
|
|
make_v: |
|
|
|
Value v = winnable(score); |
|
|
|
|
|
if constexpr (T) |
|
{ |
|
Trace::add(MATERIAL, pos.psq_score()); |
|
Trace::add(IMBALANCE, me->imbalance()); |
|
Trace::add(PAWN, pe->pawn_score(WHITE), pe->pawn_score(BLACK)); |
|
Trace::add(MOBILITY, mobility[WHITE], mobility[BLACK]); |
|
} |
|
|
|
|
|
v = (v / 16) * 16; |
|
|
|
|
|
v = (pos.side_to_move() == WHITE ? v : -v); |
|
|
|
return v; |
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
Value Eval::evaluate(const Position& pos, int* complexity) { |
|
|
|
Value v; |
|
Value psq = pos.psq_eg_stm(); |
|
|
|
|
|
|
|
|
|
bool useClassical = !useNNUE || (pos.count<ALL_PIECES>() > 7 && abs(psq) > 1760); |
|
|
|
if (useClassical) |
|
v = Evaluation<NO_TRACE>(pos).value(); |
|
else |
|
{ |
|
int nnueComplexity; |
|
int scale = 1064 + 106 * pos.non_pawn_material() / 5120; |
|
|
|
Color stm = pos.side_to_move(); |
|
Value optimism = pos.this_thread()->optimism[stm]; |
|
|
|
Value nnue = NNUE::evaluate(pos, true, &nnueComplexity); |
|
|
|
|
|
nnueComplexity = ( 416 * nnueComplexity |
|
+ 424 * abs(psq - nnue) |
|
+ (optimism > 0 ? int(optimism) * int(psq - nnue) : 0) |
|
) / 1024; |
|
|
|
|
|
if (complexity) |
|
*complexity = nnueComplexity; |
|
|
|
optimism = optimism * (269 + nnueComplexity) / 256; |
|
v = (nnue * scale + optimism * (scale - 754)) / 1024; |
|
} |
|
|
|
|
|
v = v * (195 - pos.rule50_count()) / 211; |
|
|
|
|
|
v = std::clamp(v, VALUE_TB_LOSS_IN_MAX_PLY + 1, VALUE_TB_WIN_IN_MAX_PLY - 1); |
|
|
|
|
|
if (complexity && (!useNNUE || useClassical)) |
|
*complexity = abs(v - psq); |
|
|
|
return v; |
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
std::string Eval::trace(Position& pos) { |
|
|
|
if (pos.checkers()) |
|
return "Final evaluation: none (in check)"; |
|
|
|
std::stringstream ss; |
|
ss << std::showpoint << std::noshowpos << std::fixed << std::setprecision(2); |
|
|
|
Value v; |
|
|
|
std::memset(scores, 0, sizeof(scores)); |
|
|
|
|
|
pos.this_thread()->bestValue = VALUE_ZERO; |
|
pos.this_thread()->optimism[WHITE] = VALUE_ZERO; |
|
pos.this_thread()->optimism[BLACK] = VALUE_ZERO; |
|
|
|
v = Evaluation<TRACE>(pos).value(); |
|
|
|
ss << std::showpoint << std::noshowpos << std::fixed << std::setprecision(2) |
|
<< " Contributing terms for the classical eval:\n" |
|
<< "+------------+-------------+-------------+-------------+\n" |
|
<< "| 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) |
|
<< "| Bishops | " << Term(BISHOP) |
|
<< "| Rooks | " << Term(ROOK) |
|
<< "| Queens | " << Term(QUEEN) |
|
<< "| Mobility | " << Term(MOBILITY) |
|
<< "|King safety | " << Term(KING) |
|
<< "| Threats | " << Term(THREAT) |
|
<< "| Passed | " << Term(PASSED) |
|
<< "| Space | " << Term(SPACE) |
|
<< "| Winnable | " << Term(WINNABLE) |
|
<< "+------------+-------------+-------------+-------------+\n" |
|
<< "| Total | " << Term(TOTAL) |
|
<< "+------------+-------------+-------------+-------------+\n"; |
|
|
|
if (Eval::useNNUE) |
|
ss << '\n' << NNUE::trace(pos) << '\n'; |
|
|
|
ss << std::showpoint << std::showpos << std::fixed << std::setprecision(2) << std::setw(15); |
|
|
|
v = pos.side_to_move() == WHITE ? v : -v; |
|
ss << "\nClassical evaluation " << to_cp(v) << " (white side)\n"; |
|
if (Eval::useNNUE) |
|
{ |
|
v = NNUE::evaluate(pos, false); |
|
v = pos.side_to_move() == WHITE ? v : -v; |
|
ss << "NNUE evaluation " << to_cp(v) << " (white side)\n"; |
|
} |
|
|
|
v = evaluate(pos); |
|
v = pos.side_to_move() == WHITE ? v : -v; |
|
ss << "Final evaluation " << to_cp(v) << " (white side)"; |
|
if (Eval::useNNUE) |
|
ss << " [with scaled NNUE, hybrid, ...]"; |
|
ss << "\n"; |
|
|
|
return ss.str(); |
|
} |
|
|
|
} |
|
|