Eta chess engine project paused.

I think a parallel BestFirstMiniMax-Search with NNUE eval is worth to give a try. It would be nice to compare parallel BestFirstMiniMax with MCTS-UCT, MCTS-PUCT, MCTS-AB, MCTS-Rollouts and take a look into DAG (directed acyclic graph) but I currently lack the time to work in this. There are other chess engines out there, which combine a Best-First search (MCTS-derivative) with NNUE eval.