feat: implement two-tier transposition table

1 files changed, 2 insertions, 2 deletions

diff --git a/src/grossmeister/search.rs b/src/grossmeister/search.rs
index d9dbdf1..a4b6707 100644
--- a/src/grossmeister/search.rs
+++ b/src/grossmeister/search.rs
@@ -267,7 +267,7 @@ impl Grossmeister {
         let mut pv = Vec::with_capacity(depth as usize);
 
         if depth > 0 {
-            if let Some(transposition) = self.transposition() {
+            if let Some(transposition) = self.transposition().cloned() {
                 if let Some(mov) = transposition.mov {
                     debug_assert!(transposition.depth >= depth, "TTable node should be at least as deep as we expect");
                     if transposition.depth > depth {
@@ -362,7 +362,7 @@ impl Grossmeister {
             }
         }
 
-        println!("info hashfull {}", 1000 * self.transposition_table.iter().filter(|item| item.is_some()).count() / self.transposition_table.len());
+        println!("info hashfull {}", self.table_full());
         if !pv.is_empty() {
             print!("bestmove {}", pv[0]);
             if pv.len() > 1 {