I am doing a search and evaluation re-work (in the search-eval-rework branch), and when I add the transposition table to test its performance against a version without it, it searches significantly more nodes while time-to-depth is increased.
I have checked with the debugger that cutoffs do happen and that the tt moves get sorted highest, so right now I'm at a loss as to how the table decreases performance...
I am doing a search and evaluation re-work (in the search-eval-rework branch), and when I add the transposition table to test its performance against a version without it, it searches significantly more nodes while time-to-depth is increased.
I have checked with the debugger that cutoffs do happen and that the tt moves get sorted highest, so right now I'm at a loss as to how the table decreases performance...