fn iir_can_be_applied(
    context: &mut SearchContext,
    depth: i8,
    hash_move: Move
) -> bool
Expand description

The main idea of the internal iterative reduction is that nodes without hash moves are potentially less important, so we try to save time here by reducing depth a little bit. This is not always true, but some inaccuracies should be recompensated by deeper search.

Conditions:

  • depth >= iir_min_depth
  • hash move does not exists