Use std::vector to implement HashTable

[stockfish] / src / main.cpp

diff --git a/src/main.cpp b/src/main.cpp
index 31337fa676ef9fba1de2c99d4f3ade7bf7bde8d2..505f2ef3831b2632094d65ee86696562dc38e448 100644 (file)
--- a/src/main.cpp
+++ b/src/main.cpp
@@ -25,6 +25,7 @@
 #include "position.h"
 #include "search.h"
 #include "thread.h"
+#include "tt.h"
 #include "ucioption.h"
 
 using namespace std;
@@ -35,11 +36,6 @@ extern void kpk_bitbase_init();
 
 int main(int argc, char* argv[]) {
 
-  // Don't sync with C library I/O buffers, faster but now using printf()
-  // or scanf() could yield to issues because buffers are independent.
-  cout.sync_with_stdio(false);
-  cin.sync_with_stdio(false);
-
   cout << engine_info() << endl;
 
   bitboards_init();
@@ -60,6 +56,4 @@ int main(int argc, char* argv[]) {
       cerr << "\nUsage: stockfish bench [hash size = 128] [threads = 1] "
            << "[limit = 12] [fen positions file = default] "
            << "[limited by depth, time, nodes or perft = depth]" << endl;
-
-  Threads.exit();
 }