Subversion Repositories Games.Chess Giants

Rev

Rev 96 | Rev 169 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  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 SEARCH_H_INCLUDED
  22. #define SEARCH_H_INCLUDED
  23.  
  24. #include <atomic>
  25. #include <vector>
  26.  
  27. #include "misc.h"
  28. #include "movepick.h"
  29. #include "types.h"
  30.  
  31. class Position;
  32.  
  33. namespace Search {
  34.  
  35. /// Stack struct keeps track of the information we need to remember from nodes
  36. /// shallower and deeper in the tree during the search. Each search thread has
  37. /// its own array of Stack objects, indexed by the current ply.
  38.  
  39. struct Stack {
  40.   Move* pv;
  41.   int ply;
  42.   Move currentMove;
  43.   Move excludedMove;
  44.   Move killers[2];
  45.   Value staticEval;
  46.   Value history;
  47.   bool skipEarlyPruning;
  48.   int moveCount;
  49.   CounterMoveStats* counterMoves;
  50. };
  51.  
  52.  
  53. /// RootMove struct is used for moves at the root of the tree. For each root move
  54. /// we store a score and a PV (really a refutation in the case of moves which
  55. /// fail low). Score is normally set at -VALUE_INFINITE for all non-pv moves.
  56.  
  57. struct RootMove {
  58.  
  59.   explicit RootMove(Move m) : pv(1, m) {}
  60.  
  61.   bool operator<(const RootMove& m) const { return m.score < score; } // Descending sort
  62.   bool operator==(const Move& m) const { return pv[0] == m; }
  63.   bool extract_ponder_from_tt(Position& pos);
  64.  
  65.   Value score = -VALUE_INFINITE;
  66.   Value previousScore = -VALUE_INFINITE;
  67.   std::vector<Move> pv;
  68. };
  69.  
  70. typedef std::vector<RootMove> RootMoves;
  71.  
  72.  
  73. /// LimitsType struct stores information sent by GUI about available time to
  74. /// search the current move, maximum depth/time, if we are in analysis mode or
  75. /// if we have to ponder while it's our opponent's turn to move.
  76.  
  77. struct LimitsType {
  78.  
  79.   LimitsType() { // Init explicitly due to broken value-initialization of non POD in MSVC
  80.     nodes = time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] =
  81.     npmsec = movestogo = depth = movetime = mate = infinite = ponder = 0;
  82.   }
  83.  
  84.   bool use_time_management() const {
  85.     return !(mate | movetime | depth | nodes | infinite);
  86.   }
  87.  
  88.   std::vector<Move> searchmoves;
  89.   int time[COLOR_NB], inc[COLOR_NB], npmsec, movestogo, depth, movetime, mate, infinite, ponder;
  90.   int64_t nodes;
  91.   TimePoint startTime;
  92. };
  93.  
  94.  
  95. /// SignalsType struct stores atomic flags updated during the search, typically
  96. /// in an async fashion e.g. to stop the search by the GUI.
  97.  
  98. struct SignalsType {
  99.   std::atomic_bool stop, stopOnPonderhit;
  100. };
  101.  
  102. extern SignalsType Signals;
  103. extern LimitsType Limits;
  104.  
  105. void init();
  106. void clear();
  107. template<bool Root = true> uint64_t perft(Position& pos, Depth depth);
  108.  
  109. } // namespace Search
  110.  
  111. #endif // #ifndef SEARCH_H_INCLUDED
  112.