Use std::vector to implement HashTable

[stockfish] / src / main.cpp

diff --git a/src/main.cpp b/src/main.cpp
index 37a031cbbc54b9fb0ba00f661fecba1585dce33d..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,16 +36,16 @@ extern void kpk_bitbase_init();
 
 int main(int argc, char* argv[]) {
 
+  cout << engine_info() << endl;
+
   bitboards_init();
   Position::init();
   kpk_bitbase_init();
   Search::init();
   Threads.init();
-  eval_init();
+  Eval::init();
   TT.set_size(Options["Hash"]);
 
-  cout << engine_info() << endl;
-
   if (argc == 1)
       uci_loop();
 
@@ -55,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();
 }