X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.h;h=adae851dc87d7387f336eb8eeb82d04f48b30f28;hp=3d87b9c3b5c7998121366efb615f58525247d5f5;hb=5ba85ef441fb12738732824092f74aa49149fcf9;hpb=bdb1bfecfb5665329a7d66f4c366a9736bab6c0b diff --git a/src/movepick.h b/src/movepick.h index 3d87b9c3..adae851d 100644 --- a/src/movepick.h +++ b/src/movepick.h @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2009 Marco Costalba + Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -17,103 +17,47 @@ along with this program. If not, see . */ - #if !defined MOVEPICK_H_INCLUDED #define MOVEPICK_H_INCLUDED -//// -//// Includes -//// - -#include "depth.h" -#include "lock.h" +#include "history.h" +#include "move.h" #include "position.h" +#include "types.h" - -//// -//// Types -//// - -struct EvalInfo; struct SearchStack; -extern SearchStack EmptySearchStack; - /// MovePicker is a class which is used to pick one legal move at a time from /// the current position. It is initialized with a Position object and a few /// moves we have reason to believe are good. The most important method is -/// MovePicker::pick_next_move(), which returns a new legal move each time it +/// MovePicker::get_next_move(), which returns a new legal move each time it /// is called, until there are no legal moves left, when MOVE_NONE is returned. /// In order to improve the efficiency of the alpha beta algorithm, MovePicker -/// attempts to return the moves which are most likely to be strongest first. +/// attempts to return the moves which are most likely to get a cut-off first. class MovePicker { - MovePicker& operator=(const MovePicker&); // silence a warning under MSVC + MovePicker& operator=(const MovePicker&); // Silence a warning under MSVC public: - - enum MovegenPhase { - PH_TT_MOVE, // Transposition table move - PH_MATE_KILLER, // Mate killer from the current ply - PH_GOOD_CAPTURES, // Queen promotions and captures with SEE values >= 0 - PH_KILLERS, // Killer moves from the current ply - PH_NONCAPTURES, // Non-captures and underpromotions - PH_BAD_CAPTURES, // Queen promotions and captures with SEE values < 0 - PH_EVASIONS, // Check evasions - PH_QCAPTURES, // Captures in quiescence search - PH_QCHECKS, // Non-capture checks in quiescence search - PH_STOP - }; - - MovePicker(const Position& p, bool pvnode, Move ttm, const SearchStack& ss, Depth d); + MovePicker(const Position&, Move, Depth, const History&, SearchStack*, Value); + MovePicker(const Position&, Move, Depth, const History&); Move get_next_move(); - Move get_next_move(Lock& lock); - int number_of_moves() const; - Bitboard discovered_check_candidates() const; - - static void init_phase_table(); private: void score_captures(); void score_noncaptures(); void score_evasions(); - void score_qcaptures(); - Move pick_move_from_list(); + void go_next_phase(); const Position& pos; - Move ttMove, mateKiller, killer1, killer2; - Bitboard pinned, dc; - MoveStack moves[256], badCaptures[64]; - bool pvNode; - Depth depth; - int phaseIndex; - int numOfMoves, numOfBadCaptures; - int movesPicked; - bool checkKillers, checkLegal; - bool finished; + const History& H; + Bitboard pinned; + MoveStack ttMoves[2], killers[2]; + int badCaptureThreshold, phase; + const uint8_t* phasePtr; + MoveStack *curMove, *lastMove, *lastGoodNonCapture, *badCaptures; + MoveStack moves[MOVES_MAX]; }; - -//// -//// Inline functions -//// - -/// MovePicker::number_of_moves() simply returns the numOfMoves member -/// variable. It is intended to be used in positions where the side to move -/// is in check, for detecting checkmates or situations where there is only -/// a single reply to check. - -inline int MovePicker::number_of_moves() const { - return numOfMoves; -} - -/// MovePicker::discovered_check_candidates() returns a bitboard containing -/// all pieces which can possibly give discovered check. This bitboard is -/// computed by the constructor function. - -inline Bitboard MovePicker::discovered_check_candidates() const { - return dc; -} - #endif // !defined(MOVEPICK_H_INCLUDED)