[Perf] Figure out why MTD-f / ID search algorithms are running slowly

jamesqo / chess-bot

UCI-compliant chess engine written in C#

MIT License

1 stars 0 forks source link

Closed jamesqo closed 4 years ago

jamesqo commented 4 years ago

Removing the periodic eviction scheme TranspositionTable helped speed up MTD-f a lot
Logs indicate there are lots of cutoffs that are occurring after we search 1 child, indicating that we're searching a lot of bad nodes -> could potentially benefit from better move ordering?