X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=2a090b1b30c38640f0fe2d656d85ecf851fea14e;hp=e2ae7d9591712dd5eabec2d767b72311843e0fd3;hb=a795187c50cdbe00d5364ce049d8673a04803c21;hpb=a8af78c833458adaea64b8fc1035fafbdf4ba083 diff --git a/src/movepick.cpp b/src/movepick.cpp index e2ae7d95..2a090b1b 100644 --- a/src/movepick.cpp +++ b/src/movepick.cpp @@ -50,7 +50,7 @@ namespace { } // Unary predicate used by std::partition to split positive scores from remaining - // ones so to sort separately the two sets, and with the second sort delayed. + // ones so as to sort the two sets separately, with the second sort delayed. inline bool has_positive_score(const ExtMove& ms) { return ms.score > 0; } // Picks the best move in the range (begin, end) and moves it to the front. @@ -65,10 +65,10 @@ namespace { /// Constructors of the MovePicker class. As arguments we pass information -/// to help it to return the presumably good moves first, to decide which +/// to help it to return the (presumably) good moves first, to decide which /// moves to return (in the quiescence search, for instance, we only want to -/// search captures, promotions and some checks) and about how important good -/// move ordering is at the current node. +/// search captures, promotions and some checks) and how important good move +/// ordering is at the current node. MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const HistoryStats& h, Move* cm, Search::Stack* s) : pos(p), history(h), depth(d) { @@ -286,7 +286,7 @@ void MovePicker::generate_next() { /// next_move() is the most important method of the MovePicker class. It returns /// a new pseudo legal move every time it is called, until there are no more moves /// left. It picks the move with the biggest score from a list of generated moves -/// taking care not returning the ttMove if has already been searched previously. +/// taking care not returning the ttMove if it has already been searched previously. template<> Move MovePicker::next_move() {