Large amounts of refactoring

 Extract a lot of functions from the big function into their own files

Author: confusinguser

src/algorithms/draw_checker.rs

@@ -0,0 +1,19 @@
+use std::collections::HashMap;
+
+use chess::Board;
+
+pub fn uncount_board(board_played_times_prediction: &mut HashMap<Board, u32>, new_board: &Board) {
+    board_played_times_prediction.insert(
+        // TODO Hash it to avoid copying, we need a good hash function for Board
+        *new_board,
+        *board_played_times_prediction.get(&new_board).unwrap_or(&0) - 1,
+    );
+}
+
+pub fn count_board(board_played_times_prediction: &mut HashMap<Board, u32>, new_board: &Board) {
+    board_played_times_prediction.insert(
+        // TODO Hash it to avoid copying, we need a good hash function for Board
+        *new_board,
+        *board_played_times_prediction.get(&new_board).unwrap_or(&0) + 1,
+    );
+}

src/algorithms/eval.rs

@@ -0,0 +1,24 @@
+use crate::algorithms::utils::Evaluation;
+use chess::{Board, Color};
+
+/// Investigate the reason for there being no legal moves, and return a score based on that.
+pub fn eval_no_legal_moves(board: &Board) -> f32 {
+    if board.checkers().popcnt() == 0 {
+        // Is Stalemate, no checking pieces
+        return 0.;
+    }
+
+    // If we arrive at here while it is checkmate, then we know that the side playing
+    // has been checkmated.
+    return if board.side_to_move() == Color::White {
+        f32::MIN
+    } else {
+        f32::MAX
+    };
+}
+pub fn new_eval_is_better(maximise: bool, old: &Evaluation, new: &Evaluation) -> bool {
+    new.eval.is_some()
+        && (old.eval.is_none()
+            || maximise && new.eval.unwrap() > old.eval.unwrap()
+            || !maximise && new.eval.unwrap() < old.eval.unwrap())
+}

src/algorithms/mod.rs

@@ -1,2 +1,4 @@
+mod draw_checker;
+mod eval;
 pub(crate) mod the_algorithm;
 pub(crate) mod utils;