const Value FutilityMarginQS = Value(0x80);
// Each move futility margin is decreased
- const Value IncrementalFutilityMargin = Value(0x4);
+ const Value IncrementalFutilityMargin = Value(0x8);
// Razoring
const Depth RazorDepth = 4*OnePly;
// Write PV to transposition table, in case the relevant entries have
// been overwritten during the search.
- TT.insert_pv(p, ss[0].pv);
+ //TT.insert_pv(p, ss[0].pv);
if (AbortSearch)
break; // Value cannot be trusted. Break out immediately!
Value v = value_from_tt(tte->value(), ply);
return ( tte->depth() >= depth
- || v >= Max(value_mate_in(100), beta)
- || v < Min(value_mated_in(100), beta))
+ || v >= Max(value_mate_in(PLY_MAX), beta)
+ || v < Min(value_mated_in(PLY_MAX), beta))
&& ( (is_lower_bound(tte->type()) && v >= beta)
|| (is_upper_bound(tte->type()) && v < beta));