mirror of
https://github.com/sockspls/badfish
synced 2025-04-30 16:53:09 +00:00
b009c43254
Passed STC 10+0.1 : LLR: 2.93 (-2.94,2.94) <-1.75,0.25> Total: 349760 W: 90112 L: 90231 D: 169417 Ptnml(0-2): 784, 37970, 97496, 37841, 789 https://tests.stockfishchess.org/tests/view/665aeee00223e235f05b7d21 Passed LTC 60+0.6 : LLR: 2.95 (-2.94,2.94) <-1.75,0.25> Total: 140082 W: 35463 L: 35370 D: 69249 Ptnml(0-2): 59, 13492, 42851, 13575, 64 https://tests.stockfishchess.org/tests/view/665b15e78da109e362924e5a closes https://github.com/official-stockfish/Stockfish/pull/5334 No functional change
67 lines
2 KiB
C++
67 lines
2 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,
|
|
double& originalTimeAdjust);
|
|
|
|
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
|