mirror of
https://github.com/sockspls/badfish
synced 2025-04-30 08:43:09 +00:00
9953bfff62
Adjust criterion for applying extra reduction if not improving. We now add an extra ply of reduction if r > 1.0, instead of the previous condition Reductions[NonPV][imp][d][mc] >= 2. Why does this work? Previously, reductions when not improving had a discontinuity as the depth and/or move count increases due to the Reductions[NonPV][imp][d][mc] >= 2 condition. Hence, values of r such that 0.5 < r < 1.5 would be mapped to a reduction of 1, while 1.5 < r < 2.5 would be mapped to a reduction of 3. This patch allows values of r satisfying 1.0 < r < 1.5 to be mapped to a reduction of 2, making the reduction formula more continuous. STC: LLR: 2.96 (-2.94,2.94) [0.00,5.00] Total: 35908 W: 7382 L: 7087 D: 21439 http://tests.stockfishchess.org/tests/view/5aba723a0ebc5902a4743e8f LTC: LLR: 2.96 (-2.94,2.94) [0.00,5.00] Total: 23087 W: 3584 L: 3378 D: 16125 http://tests.stockfishchess.org/tests/view/5aba89070ebc5902a4743ea9 Ideas for future work: - We could look at retuning the LMR formula. - We could look at adjusting the reductions in PV nodes if not improving. Bench: 5326261
49 lines
1.7 KiB
C++
49 lines
1.7 KiB
C++
/*
|
|
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-2018 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
|
|
|
|
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/>.
|
|
*/
|
|
|
|
#ifndef TIMEMAN_H_INCLUDED
|
|
#define TIMEMAN_H_INCLUDED
|
|
|
|
#include "misc.h"
|
|
#include "search.h"
|
|
#include "thread.h"
|
|
|
|
/// The TimeManagement class computes the optimal time to think depending on
|
|
/// the maximum available time, the game move number and other parameters.
|
|
|
|
class TimeManagement {
|
|
public:
|
|
void init(Search::LimitsType& limits, Color us, int ply);
|
|
TimePoint optimum() const { return optimumTime; }
|
|
TimePoint maximum() const { return maximumTime; }
|
|
TimePoint elapsed() const { return Search::Limits.npmsec ?
|
|
TimePoint(Threads.nodes_searched()) : now() - startTime; }
|
|
|
|
int64_t availableNodes; // When in 'nodes as time' mode
|
|
|
|
private:
|
|
TimePoint startTime;
|
|
TimePoint optimumTime;
|
|
TimePoint maximumTime;
|
|
};
|
|
|
|
extern TimeManagement Time;
|
|
|
|
#endif // #ifndef TIMEMAN_H_INCLUDED
|