small into improvements

src/game.rs

@@ -179,7 +179,7 @@ impl Game {
      * \return bitboard containig all occupied squares
      */
     pub fn occupied(&self) -> Bitboard {
-        self.pieces.into_iter().fold(0, |a, b| { a | b } )
+        self.pieces.iter().fold(0, |a, b| { a | b } )
     }
 
     pub fn pawns(&self, side: Side) -> Bitboard {

src/main.rs

@@ -26,7 +26,7 @@ fn main() {
         //.target(Target::Stderr)
         .init();
         */
-    simplelog::WriteLogger::init(LevelFilter::Info, Config::default(), File::create("C:\\\\Users\\Nicolas\\debug.log").unwrap()).unwrap();
+    //simplelog::WriteLogger::init(LevelFilter::Info, Config::default(), File::create("~/debug.log").unwrap()).unwrap();
 
     let (esend, erecv) = mpsc::channel();
     let (isend, irecv) = mpsc::channel();

src/movegen.rs

@@ -299,12 +299,12 @@ fn generate_sliding_destinations(friends: Bitboard, others: Bitboard,
 
     let mut result: Bitboard = 0;
     if straight {
-        for direction in straights.into_iter() {
+        for direction in straights.iter() {
             result |= generate_direction(piece, *direction, occupied);
         }
     }
     if diagonal {
-        for direction in diagonals.into_iter() {
+        for direction in diagonals.iter() {
             result |= generate_direction(piece, *direction, occupied);
         }
     }

src/search.rs

@@ -58,7 +58,7 @@ pub fn search(game: &Game, depth: i32) -> Move {
 
     if valued_moves.len() > 0 {
         let min_val = valued_moves[0].1;
-        let best_moves = valued_moves.iter().filter(|mv| mv.1 <= min_val).map(|(mov, _)| *mov).collect::<Vec<Move>>();
+        let best_moves = valued_moves.iter().filter(|mv| mv.1 == min_val).map(|(mov, _)| *mov).collect::<Vec<Move>>();
 
         return best_moves[(rng.next_u64() % best_moves.len() as u64) as usize];
     }