fixed #5

thomas.jahn · thomas.jahn · commit efcae3387ab9 · 2025-04-17T13:20:42.000+02:00
diff --git a/MinimalChess/IterativeSearch.cs b/MinimalChess/IterativeSearch.cs
@@ -63,7 +63,9 @@ private void StorePVinTT(Move[] pv, int depth)
                 return (ttScore, Array.Empty<Move>());
 
             var result = EvalPosition(position, ply, depth, window);
-            Transpositions.Store(position.ZobristHash, depth, ply, window, result.Score, result.PV.Length > 0 ? result.PV[0] : default);
+            if(!Aborted)
+                Transpositions.Store(position.ZobristHash, depth, ply, window, result.Score, result.PV.Length > 0 ? result.PV[0] : default);
+            
             return result;
         }
 
@@ -136,8 +138,6 @@ private void StorePVinTT(Move[] pv, int depth)
                     continue;
                 }
 
-                //the position has a new best move and score!
-                Transpositions.Store(position.ZobristHash, depth, ply, window, eval.Score, move);
                 //set the PV to this move, followed by the PV of the childnode
                 pv = Merge(move, eval.PV);
                 //...and maybe we even get a beta cutoff
