Rev 169 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
96 | pmbaty | 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-2016 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 | int optimum() const { return optimumTime; } |
||
35 | int maximum() const { return maximumTime; } |
||
36 | int elapsed() const { return int(Search::Limits.npmsec ? Threads.nodes_searched() : now() - startTime); } |
||
37 | |||
38 | int64_t availableNodes; // When in 'nodes as time' mode |
||
39 | |||
40 | private: |
||
41 | TimePoint startTime; |
||
42 | int optimumTime; |
||
43 | int maximumTime; |
||
44 | }; |
||
45 | |||
46 | extern TimeManagement Time; |
||
47 | |||
48 | #endif // #ifndef TIMEMAN_H_INCLUDED |