// pick_best() finds the best move in the range (begin, end) and moves it to
// the front. It's faster than sorting all the moves in advance when there
// are few moves e.g. the possible captures.
- inline Move pick_best(ExtMove* begin, ExtMove* end)
+ Move pick_best(ExtMove* begin, ExtMove* end)
{
std::swap(*begin, *std::max_element(begin, end));
return *begin;
for (auto& m : *this)
m.value = history[pos.moved_piece(m)][to_sq(m)]
- + cmh[pos.moved_piece(m)][to_sq(m)];
+ + cmh[pos.moved_piece(m)][to_sq(m)] * 3;
}
template<>