diff --git a/Rapfi/search/ab/search.cpp b/Rapfi/search/ab/search.cpp
index 1c30546..4199663 100644
--- a/Rapfi/search/ab/search.cpp
+++ b/Rapfi/search/ab/search.cpp
@@ -841,7 +841,7 @@ Value search(Board &board, SearchStack *ss, Value alpha, Value beta, Depth depth
     if (!PvNode
         && (alpha < VALUE_MATE_IN_MAX_PLY || !ttHit)  // We are not searching for a short win
         && eval + razorMargin<Rule>(depth) < alpha) {
-        return vcfsearch<Rule, NonPV>(board, ss, alpha, alpha + 1);
+        return eval;
     }
 
     // Step 8. Futility pruning: child node (~121 elo)
@@ -889,9 +889,9 @@ Value search(Board &board, SearchStack *ss, Value alpha, Value beta, Depth depth
     if (PvNode && depth > 1 && ttMove)
         depth -= std::clamp((depth - ttDepth) * IIR_REDUCTION_TT, 0.0f, IIR_REDUCTION_TT_MAX);
 
-    // Drop to vcfsearch if depth is below zero
+    // Drop to leaf node if depth is below zero
     if (depth <= 0)
-        return vcfsearch<Rule, NT>(board, ss, alpha, beta);
+        return search<Rule, NT>(board, ss, alpha, beta, depth, cutNode);
 
     // Internal iterative deepening on higher depth (~1 elo)
     if (depth >= IID_DEPTH && !ttMove) {