mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-25 03:26:24 +08:00
2dbb44e28d
1. The current time management system utilizes limits.inc and limits.time, which can represent either milliseconds or node count, depending on whether the nodestime option is active. There have been several modifications which brought Elo gain for typical uses (i.e. real-time matches), however some of these changes overlooked such distinction. This patch adjusts constants and multiplication/division to more accurately simulate real TC conditions when nodestime is used. 2. The advance_nodes_time function has a bug that can extend the time limit when availableNodes reaches exact zero. This patch fixes the bug by initializing the variable to -1 and make sure it does not go below zero. 3. elapsed_time function is newly introduced to print PV in the UCI output based on real time. This makes PV output more consistent with the behavior of trivial use cases. closes https://github.com/official-stockfish/Stockfish/pull/5186 No functional changes
64 lines
1.9 KiB
C++
64 lines
1.9 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2024 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/>.
|
|
*/
|
|
|
|
#ifndef TIMEMAN_H_INCLUDED
|
|
#define TIMEMAN_H_INCLUDED
|
|
|
|
#include <cstdint>
|
|
|
|
#include "misc.h"
|
|
#include "types.h"
|
|
|
|
namespace Stockfish {
|
|
|
|
class OptionsMap;
|
|
|
|
namespace Search {
|
|
struct LimitsType;
|
|
}
|
|
|
|
// 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, const OptionsMap& options);
|
|
|
|
TimePoint optimum() const;
|
|
TimePoint maximum() const;
|
|
template<typename FUNC>
|
|
TimePoint elapsed(FUNC nodes) const {
|
|
return useNodesTime ? TimePoint(nodes()) : elapsed_time();
|
|
}
|
|
TimePoint elapsed_time() const { return now() - startTime; };
|
|
|
|
void clear();
|
|
void advance_nodes_time(std::int64_t nodes);
|
|
|
|
private:
|
|
TimePoint startTime;
|
|
TimePoint optimumTime;
|
|
TimePoint maximumTime;
|
|
|
|
std::int64_t availableNodes = -1; // When in 'nodes as time' mode
|
|
bool useNodesTime = false; // True if we are in 'nodes as time' mode
|
|
};
|
|
|
|
} // namespace Stockfish
|
|
|
|
#endif // #ifndef TIMEMAN_H_INCLUDED
|