opelly/Stockfish
1
0
Fork 0
mirror of https://github.com/opelly27/Stockfish.git synced 2026-05-20 06:17:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update outdated comments

Browse Source 
closes https://github.com/official-stockfish/Stockfish/pull/5158

No functional change
This commit is contained in:
Disservin
2024-04-07 14:26:23 +02:00
committed by Joost VandeVondele
parent c55ae376f6
commit 432995ad82
3 changed files with 3 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/position.cpp
-1
View File
@@ -744,7 +744,6 @@ void Position::do_move(Move m, StateInfo& newSt, bool givesCheck) {
// Update board and piece lists // Update board and piece lists
remove_piece(capsq); remove_piece(capsq);
// Update material hash key and prefetch access to materialTable
k ^= Zobrist::psq[captured][capsq]; k ^= Zobrist::psq[captured][capsq];
st->materialKey ^= Zobrist::psq[captured][pieceCount[captured]]; st->materialKey ^= Zobrist::psq[captured][pieceCount[captured]];
src/search.cpp
+2 -2
View File
@@ -1083,7 +1083,7 @@ moves_loop: // When in check, search starts here
extension = -1; extension = -1;
} }
// Recapture extensions (~0 Elo on STC, ~1 Elo on LTC) // Extension for capturing the previous moved piece (~0 Elo on STC, ~1 Elo on LTC)
else if (PvNode && move == ttMove && move.to_sq() == prevSq else if (PvNode && move == ttMove && move.to_sq() == prevSq
&& thisThread->captureHistory[movedPiece][move.to_sq()] && thisThread->captureHistory[movedPiece][move.to_sq()]
[type_of(pos.piece_on(move.to_sq()))] [type_of(pos.piece_on(move.to_sq()))]
@@ -1147,7 +1147,7 @@ moves_loop: // When in check, search starts here
{ {
// In general we want to cap the LMR depth search at newDepth, but when // In general we want to cap the LMR depth search at newDepth, but when
// reduction is negative, we allow this move a limited search extension // reduction is negative, we allow this move a limited search extension
// beyond the first move depth. This may lead to hidden multiple extensions. // beyond the first move depth.
// To prevent problems when the max value is less than the min value, // To prevent problems when the max value is less than the min value,
// std::clamp has been replaced by a more robust implementation. // std::clamp has been replaced by a more robust implementation.
Depth d = std::max(1, std::min(newDepth - r, newDepth + 1)); Depth d = std::max(1, std::min(newDepth - r, newDepth + 1));
src/tt.cpp
+1 -1
View File
@@ -67,7 +67,7 @@ uint8_t TTEntry::relative_age(const uint8_t generation8) const {
// Sets the size of the transposition table, // Sets the size of the transposition table,
// measured in megabytes. Transposition table consists of a power of 2 number // measured in megabytes. Transposition table consists
// of clusters and each cluster consists of ClusterSize number of TTEntry. // of clusters and each cluster consists of ClusterSize number of TTEntry.
void TranspositionTable::resize(size_t mbSize, int threadCount) { void TranspositionTable::resize(size_t mbSize, int threadCount) {
aligned_large_pages_free(table); aligned_large_pages_free(table);