mirror of
https://github.com/opelly27/Stockfish.git
synced 2026-05-20 13:17:44 +00:00
syzygy1
2046d5da30
This patch was inspired by c065abd which updates the accumulator,
if possible, based on the accumulator of two plies back if
the accumulator of the preceding ply is not available.
With this patch we look back even further in the position history
in an attempt to reduce the number of complete recomputations.
When we find a usable accumulator for the position N plies back,
we also update the accumulator of the position N-1 plies back
because that accumulator is most likely to be helpful later
when evaluating positions in sibling branches.
By not updating all intermediate accumulators immediately,
we avoid doing too much work that is not certain to be useful.
Overall, roughly 2-3% speedup.
This patch makes the code more specific to the net architecture,
changing input features of the net will require additional changes
to the incremental update code as discussed in the PR #3193 and #3191.
Passed STC:
https://tests.stockfishchess.org/tests/view/5f9056712c92c7fe3a8c60d0
LLR: 2.94 (-2.94,2.94) {-0.25,1.25}
Total: 10040 W: 1116 L: 968 D: 7956
Ptnml(0-2): 42, 722, 3365, 828, 63
closes https://github.com/official-stockfish/Stockfish/pull/3193
No functional change.
41 lines
1.4 KiB
C++
41 lines
1.4 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
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
|
|
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/>.
|
|
*/
|
|
|
|
// Class for difference calculation of NNUE evaluation function
|
|
|
|
#ifndef NNUE_ACCUMULATOR_H_INCLUDED
|
|
#define NNUE_ACCUMULATOR_H_INCLUDED
|
|
|
|
#include "nnue_architecture.h"
|
|
|
|
namespace Eval::NNUE {
|
|
|
|
// The accumulator of a StateInfo without parent is set to the INIT state
|
|
enum AccumulatorState { EMPTY, COMPUTED, INIT };
|
|
|
|
// Class that holds the result of affine transformation of input features
|
|
struct alignas(kCacheLineSize) Accumulator {
|
|
std::int16_t
|
|
accumulation[2][kRefreshTriggers.size()][kTransformedFeatureDimensions];
|
|
AccumulatorState state[2];
|
|
};
|
|
|
|
} // namespace Eval::NNUE
|
|
|
|
#endif // NNUE_ACCUMULATOR_H_INCLUDED
|