mirror of
https://github.com/sockspls/badfish
synced 2025-06-28 00:19:50 +00:00
b60f9cc451
Happy New Year! closes https://github.com/official-stockfish/Stockfish/pull/4315 No functional change
152 lines
6.2 KiB
C++
152 lines
6.2 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2023 The Stockfish developers (see AUTHORS file)
|
|
|
|
Stockfish is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
//Definition of input features HalfKP of NNUE evaluation function
|
|
|
|
#ifndef NNUE_FEATURES_HALF_KA_V2_HM_H_INCLUDED
|
|
#define NNUE_FEATURES_HALF_KA_V2_HM_H_INCLUDED
|
|
|
|
#include "../nnue_common.h"
|
|
|
|
#include "../../evaluate.h"
|
|
#include "../../misc.h"
|
|
|
|
namespace Stockfish {
|
|
struct StateInfo;
|
|
}
|
|
|
|
namespace Stockfish::Eval::NNUE::Features {
|
|
|
|
// Feature HalfKAv2_hm: Combination of the position of own king
|
|
// and the position of pieces. Position mirrored such that king always on e..h files.
|
|
class HalfKAv2_hm {
|
|
|
|
// unique number for each piece type on each square
|
|
enum {
|
|
PS_NONE = 0,
|
|
PS_W_PAWN = 0,
|
|
PS_B_PAWN = 1 * SQUARE_NB,
|
|
PS_W_KNIGHT = 2 * SQUARE_NB,
|
|
PS_B_KNIGHT = 3 * SQUARE_NB,
|
|
PS_W_BISHOP = 4 * SQUARE_NB,
|
|
PS_B_BISHOP = 5 * SQUARE_NB,
|
|
PS_W_ROOK = 6 * SQUARE_NB,
|
|
PS_B_ROOK = 7 * SQUARE_NB,
|
|
PS_W_QUEEN = 8 * SQUARE_NB,
|
|
PS_B_QUEEN = 9 * SQUARE_NB,
|
|
PS_KING = 10 * SQUARE_NB,
|
|
PS_NB = 11 * SQUARE_NB
|
|
};
|
|
|
|
static constexpr IndexType PieceSquareIndex[COLOR_NB][PIECE_NB] = {
|
|
// convention: W - us, B - them
|
|
// viewed from other side, W and B are reversed
|
|
{ PS_NONE, PS_W_PAWN, PS_W_KNIGHT, PS_W_BISHOP, PS_W_ROOK, PS_W_QUEEN, PS_KING, PS_NONE,
|
|
PS_NONE, PS_B_PAWN, PS_B_KNIGHT, PS_B_BISHOP, PS_B_ROOK, PS_B_QUEEN, PS_KING, PS_NONE },
|
|
{ PS_NONE, PS_B_PAWN, PS_B_KNIGHT, PS_B_BISHOP, PS_B_ROOK, PS_B_QUEEN, PS_KING, PS_NONE,
|
|
PS_NONE, PS_W_PAWN, PS_W_KNIGHT, PS_W_BISHOP, PS_W_ROOK, PS_W_QUEEN, PS_KING, PS_NONE }
|
|
};
|
|
|
|
// Index of a feature for a given king position and another piece on some square
|
|
template<Color Perspective>
|
|
static IndexType make_index(Square s, Piece pc, Square ksq);
|
|
|
|
public:
|
|
// Feature name
|
|
static constexpr const char* Name = "HalfKAv2_hm(Friend)";
|
|
|
|
// Hash value embedded in the evaluation file
|
|
static constexpr std::uint32_t HashValue = 0x7f234cb8u;
|
|
|
|
// Number of feature dimensions
|
|
static constexpr IndexType Dimensions =
|
|
static_cast<IndexType>(SQUARE_NB) * static_cast<IndexType>(PS_NB) / 2;
|
|
|
|
#define B(v) (v * PS_NB)
|
|
static constexpr int KingBuckets[COLOR_NB][SQUARE_NB] = {
|
|
{ B(28), B(29), B(30), B(31), B(31), B(30), B(29), B(28),
|
|
B(24), B(25), B(26), B(27), B(27), B(26), B(25), B(24),
|
|
B(20), B(21), B(22), B(23), B(23), B(22), B(21), B(20),
|
|
B(16), B(17), B(18), B(19), B(19), B(18), B(17), B(16),
|
|
B(12), B(13), B(14), B(15), B(15), B(14), B(13), B(12),
|
|
B( 8), B( 9), B(10), B(11), B(11), B(10), B( 9), B( 8),
|
|
B( 4), B( 5), B( 6), B( 7), B( 7), B( 6), B( 5), B( 4),
|
|
B( 0), B( 1), B( 2), B( 3), B( 3), B( 2), B( 1), B( 0) },
|
|
{ B( 0), B( 1), B( 2), B( 3), B( 3), B( 2), B( 1), B( 0),
|
|
B( 4), B( 5), B( 6), B( 7), B( 7), B( 6), B( 5), B( 4),
|
|
B( 8), B( 9), B(10), B(11), B(11), B(10), B( 9), B( 8),
|
|
B(12), B(13), B(14), B(15), B(15), B(14), B(13), B(12),
|
|
B(16), B(17), B(18), B(19), B(19), B(18), B(17), B(16),
|
|
B(20), B(21), B(22), B(23), B(23), B(22), B(21), B(20),
|
|
B(24), B(25), B(26), B(27), B(27), B(26), B(25), B(24),
|
|
B(28), B(29), B(30), B(31), B(31), B(30), B(29), B(28) }
|
|
};
|
|
#undef B
|
|
|
|
// Orient a square according to perspective (rotates by 180 for black)
|
|
static constexpr int OrientTBL[COLOR_NB][SQUARE_NB] = {
|
|
{ SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
|
|
SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
|
|
SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
|
|
SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
|
|
SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
|
|
SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
|
|
SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
|
|
SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1 },
|
|
{ SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
|
|
SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
|
|
SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
|
|
SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
|
|
SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
|
|
SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
|
|
SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
|
|
SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8 }
|
|
};
|
|
|
|
// Maximum number of simultaneously active features.
|
|
static constexpr IndexType MaxActiveDimensions = 32;
|
|
using IndexList = ValueList<IndexType, MaxActiveDimensions>;
|
|
|
|
// Get a list of indices for active features
|
|
template<Color Perspective>
|
|
static void append_active_indices(
|
|
const Position& pos,
|
|
IndexList& active);
|
|
|
|
// Get a list of indices for recently changed features
|
|
template<Color Perspective>
|
|
static void append_changed_indices(
|
|
Square ksq,
|
|
const DirtyPiece& dp,
|
|
IndexList& removed,
|
|
IndexList& added
|
|
);
|
|
|
|
// Returns the cost of updating one perspective, the most costly one.
|
|
// Assumes no refresh needed.
|
|
static int update_cost(const StateInfo* st);
|
|
static int refresh_cost(const Position& pos);
|
|
|
|
// Returns whether the change stored in this StateInfo means that
|
|
// a full accumulator refresh is required.
|
|
static bool requires_refresh(const StateInfo* st, Color perspective);
|
|
};
|
|
|
|
} // namespace Stockfish::Eval::NNUE::Features
|
|
|
|
#endif // #ifndef NNUE_FEATURES_HALF_KA_V2_HM_H_INCLUDED
|