void Search::init() {
for (int i = 1; i < MAX_MOVES; ++i)
- Reductions[i] = int(23.4 * std::log(i));
+ Reductions[i] = int((23.4 + std::log(Threads.size()) / 2) * std::log(i));
}
&& pos.advanced_pawn_push(move)
&& pos.pawn_passed(us, to_sq(move)))
extension = ONE_PLY;
-
+
// Castling extension
if (type_of(move) == CASTLING)
extension = ONE_PLY;