"Fossies" - the Fresh Open Source Software Archive

Member "stockfish-11-linux/src/timeman.h" (18 Jan 2020, 1741 Bytes) of package /linux/privat/stockfish-11-linux.zip:


As a special service "Fossies" has tried to format the requested source page into HTML format using (guessed) C and C++ source code syntax highlighting (style: standard) with prefixed line numbers and code folding option. Alternatively you can here view or download the uninterpreted source code file. See also the last Fossies "Diffs" side-by-side code changes report for "timeman.h": 9-linux_vs_10-linux.

    1 /*
    2   Stockfish, a UCI chess playing engine derived from Glaurung 2.1
    3   Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
    4   Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
    5   Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
    6 
    7   Stockfish is free software: you can redistribute it and/or modify
    8   it under the terms of the GNU General Public License as published by
    9   the Free Software Foundation, either version 3 of the License, or
   10   (at your option) any later version.
   11 
   12   Stockfish is distributed in the hope that it will be useful,
   13   but WITHOUT ANY WARRANTY; without even the implied warranty of
   14   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   15   GNU General Public License for more details.
   16 
   17   You should have received a copy of the GNU General Public License
   18   along with this program.  If not, see <http://www.gnu.org/licenses/>.
   19 */
   20 
   21 #ifndef TIMEMAN_H_INCLUDED
   22 #define TIMEMAN_H_INCLUDED
   23 
   24 #include "misc.h"
   25 #include "search.h"
   26 #include "thread.h"
   27 
   28 /// The TimeManagement class computes the optimal time to think depending on
   29 /// the maximum available time, the game move number and other parameters.
   30 
   31 class TimeManagement {
   32 public:
   33   void init(Search::LimitsType& limits, Color us, int ply);
   34   TimePoint optimum() const { return optimumTime; }
   35   TimePoint maximum() const { return maximumTime; }
   36   TimePoint elapsed() const { return Search::Limits.npmsec ?
   37                                      TimePoint(Threads.nodes_searched()) : now() - startTime; }
   38 
   39   int64_t availableNodes; // When in 'nodes as time' mode
   40 
   41 private:
   42   TimePoint startTime;
   43   TimePoint optimumTime;
   44   TimePoint maximumTime;
   45 };
   46 
   47 extern TimeManagement Time;
   48 
   49 #endif // #ifndef TIMEMAN_H_INCLUDED