diff --git a/src/logic/future_moves.rs b/src/logic/future_moves.rs
index d751604..3f9f85c 100644
--- a/src/logic/future_moves.rs
+++ b/src/logic/future_moves.rs
@@ -105,14 +105,14 @@ impl FutureMoves {
 
     /// Returns indexes of leaf [`Move`]s, sorted by their depth (increasing order)
     fn leaf_moves(&self) -> Vec<usize> {
-        let mut indexes = (0..self.arena.len())
+        let mut indexes: Vec<usize> = (0..self.arena.len())
             // we want to select all nodes that don't have children, or are lazy (need to maybe be regenerated)
             .filter(|&idx| {
                 let got = &self.arena[idx];
                 !got.is_trimmed && !got.tried_children && got.winner == Winner::None
             })
             .filter(|&idx| self.is_connected_to_root(idx))
-            .collect::<Vec<usize>>();
+            .collect();
 
         // we want to try and make the tree even in depth
         // by first generating children for younger moves