/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
- Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2004-2020 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
#include <string>
#include "bitboard.h"
+#include "evaluate.h"
#include "types.h"
+#include "nnue/nnue_accumulator.h"
+
/// StateInfo struct stores information needed to restore a Position object to
/// its previous state when we retract a move. Whenever a move is made on the
Bitboard pinners[COLOR_NB];
Bitboard checkSquares[PIECE_TYPE_NB];
int repetition;
+
+ // Used by NNUE
+ Eval::NNUE::Accumulator accumulator;
+ DirtyPiece dirtyPiece;
};
+
/// A list to keep track of the position states along the setup moves (from the
/// start position to the position just before the search starts). Needed by
/// 'draw by repetition' detection. Use a std::deque because pointers to
bool is_on_semiopen_file(Color c, Square s) const;
// Castling
- int castling_rights(Color c) const;
+ CastlingRights castling_rights(Color c) const;
bool can_castle(CastlingRights cr) const;
bool castling_impeded(CastlingRights cr) const;
Square castling_rook_square(CastlingRights cr) const;
// Attacks to/from a given square
Bitboard attackers_to(Square s) const;
Bitboard attackers_to(Square s, Bitboard occupied) const;
- Bitboard attacks_from(PieceType pt, Square s) const;
- template<PieceType> Bitboard attacks_from(Square s) const;
- template<PieceType> Bitboard attacks_from(Square s, Color c) const;
Bitboard slider_blockers(Bitboard sliders, Square s, Bitboard& pinners) const;
// Properties of moves
bool pos_is_ok() const;
void flip();
+ // Used by NNUE
+ StateInfo* state() const;
+ const EvalList* eval_list() const;
+
private:
// Initialization helpers (used while setting up a position)
void set_castling_right(Color c, Square rfrom);
template<bool Do>
void do_castling(Color us, Square from, Square& to, Square& rfrom, Square& rto);
+ // ID of a piece on a given square
+ PieceId piece_id_on(Square sq) const;
+
// Data members
Piece board[SQUARE_NB];
Bitboard byTypeBB[PIECE_TYPE_NB];
Thread* thisThread;
StateInfo* st;
bool chess960;
+
+ // List of pieces used in NNUE evaluation function
+ EvalList evalList;
};
namespace PSQT {
return st->castlingRights & cr;
}
-inline int Position::castling_rights(Color c) const {
+inline CastlingRights Position::castling_rights(Color c) const {
return c & CastlingRights(st->castlingRights);
}
return castlingRookSquare[cr];
}
-template<PieceType Pt>
-inline Bitboard Position::attacks_from(Square s) const {
- static_assert(Pt != PAWN, "Pawn attacks need color");
-
- return Pt == BISHOP || Pt == ROOK ? attacks_bb<Pt>(s, pieces())
- : Pt == QUEEN ? attacks_from<ROOK>(s) | attacks_from<BISHOP>(s)
- : PseudoAttacks[Pt][s];
-}
-
-template<>
-inline Bitboard Position::attacks_from<PAWN>(Square s, Color c) const {
- return PawnAttacks[c][s];
-}
-
-inline Bitboard Position::attacks_from(PieceType pt, Square s) const {
- return attacks_bb(pt, s, pieces());
-}
-
inline Bitboard Position::attackers_to(Square s) const {
return attackers_to(s, pieces());
}
inline void Position::put_piece(Piece pc, Square s) {
board[s] = pc;
- byTypeBB[ALL_PIECES] |= s;
- byTypeBB[type_of(pc)] |= s;
+ byTypeBB[ALL_PIECES] |= byTypeBB[type_of(pc)] |= s;
byColorBB[color_of(pc)] |= s;
index[s] = pieceCount[pc]++;
pieceList[pc][index[s]] = s;
do_move(m, newSt, gives_check(m));
}
+inline StateInfo* Position::state() const {
+
+ return st;
+}
+
+inline const EvalList* Position::eval_list() const {
+
+ return &evalList;
+}
+
+inline PieceId Position::piece_id_on(Square sq) const
+{
+
+ assert(piece_on(sq) != NO_PIECE);
+
+ PieceId pid = evalList.piece_id_list[sq];
+ assert(is_ok(pid));
+
+ return pid;
+}
+
#endif // #ifndef POSITION_H_INCLUDED