Use TT to store best move after each ID iteration

src/search/mod.rs

@@ -1,5 +1,3 @@
-use crate::movegen::r#move::Move;
-
 pub mod iterative_deepening;
 pub mod move_ordering;
 pub mod negamax;
@@ -14,17 +12,3 @@ pub const HARD_LIMIT_DIVISION: u128 = 10; // % of the remaining time
 pub const SOFT_LIMIT_DIVISION: u128 = HARD_LIMIT_DIVISION / 2;
 pub const SOFT_EVAL_THRESHOLD: i32 = 500;
 pub const MAX_TT_SIZE: u64 = 1000000;
-
-pub struct SearchResult {
-    pub best_move: Option<Move>,
-    pub best_score: i32,
-}
-
-impl SearchResult {
-    pub const fn new(best_move: Option<Move>, best_score: i32) -> Self {
-        Self {
-            best_move,
-            best_score,
-        }
-    }
-}