diff --git a/Rapfi/search/ab/search.cpp b/Rapfi/search/ab/search.cpp
index 47470f4..5a98649 100644
--- a/Rapfi/search/ab/search.cpp
+++ b/Rapfi/search/ab/search.cpp
@@ -899,19 +899,19 @@ Value search(Board &board, SearchStack *ss, Value alpha, Value beta, Depth depth
     if (depth <= 0)
         return vcfsearch<Rule, NT>(board, ss, alpha, beta);
 
-    if (depth >= IID_DEPTH && !ttMove) {
-        depth -= IIR_REDUCTION;
-
-        // We only need best move from the iid search, so we just discard its result
-        search<Rule, NT>(board, ss, alpha, beta, depth - iidDepthReduction<Rule>(depth), cutNode);
-
-        // Get best move from transposition table, which should be just written by the search.
-        Value tmpEval;
-        bool  tmpIsPv;
-        Bound tmpBound;
-        int   tmpDepth;
-        ttHit = TT.probe(posKey, ttValue, tmpEval, tmpIsPv, tmpBound, ttMove, tmpDepth, ss->ply);
-    }
+    //if (depth >= IID_DEPTH && !ttMove) {
+    //    depth -= IIR_REDUCTION;
+
+    //    // We only need best move from the iid search, so we just discard its result
+    //    search<Rule, NT>(board, ss, alpha, beta, depth - iidDepthReduction<Rule>(depth), cutNode);
+
+    //    // Get best move from transposition table, which should be just written by the search.
+    //    Value tmpEval;
+    //    bool  tmpIsPv;
+    //    Bound tmpBound;
+    //    int   tmpDepth;
+    //    ttHit = TT.probe(posKey, ttValue, tmpEval, tmpIsPv, tmpBound, ttMove, tmpDepth, ss->ply);
+    //}
 
     // When opponent is doing A_FIVE attack, search starts from here
 moves_loop: