diff --git a/src/problem/mod.rs b/src/problem/mod.rs
index 78b13db..26cb007 100644
--- a/src/problem/mod.rs
+++ b/src/problem/mod.rs
@@ -350,3 +350,5 @@ mod p51_n_queens;
 mod p3274_check_if_two_chessboard_squares_have_the_same_color;
 
 mod p2056_number_of_valid_move_combinations_on_chessboard;
+
+mod p3001_minimum_moves_to_capture_the_queen;
diff --git a/src/problem/p3001_minimum_moves_to_capture_the_queen.rs b/src/problem/p3001_minimum_moves_to_capture_the_queen.rs
new file mode 100644
index 0000000..7dfaae7
--- /dev/null
+++ b/src/problem/p3001_minimum_moves_to_capture_the_queen.rs
@@ -0,0 +1,73 @@
+/**
+ * [3001] Minimum Moves to Capture The Queen
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn min_moves_to_capture_the_queen(a: i32, b: i32, c: i32, d: i32, e: i32, f: i32) -> i32 {
+        let rook_min_path = if a == e || b == f {
+            if Self::check_on_path(c, d, a, b, e, f) {
+                2
+            } else {
+                1
+            }
+        } else {
+            2
+        };
+
+        let bishop_min_path = if c.abs_diff(e) == d.abs_diff(f) {
+            if Self::check_on_path(a, b, c, d, e, f) {
+                2
+            } else {
+                1
+            }
+        } else {
+            2
+        };
+
+        rook_min_path.min(bishop_min_path)
+    }
+
+    fn check_on_path(a: i32, b: i32, c: i32, d: i32, e: i32, f: i32) -> bool {
+        let delta = c.abs_diff(e).max(d.abs_diff(f)) as i32;
+        let (dx, dy) = ((e - c) / delta, (f - d) / delta);
+
+        if (1..=delta)
+            .map(|i| (c + (i * dx), d + (i * dy)))
+            .any(|(x, y)| x == a && y == b)
+        {
+            true
+        } else {
+            false
+        }
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_3001() {
+        assert_eq!(
+            1,
+            Solution::min_moves_to_capture_the_queen(7, 4, 1, 4, 7, 8)
+        );
+        assert_eq!(
+            2,
+            Solution::min_moves_to_capture_the_queen(4, 3, 3, 4, 5, 2)
+        );
+        assert_eq!(
+            2,
+            Solution::min_moves_to_capture_the_queen(1, 1, 8, 8, 2, 3)
+        );
+        assert_eq!(
+            1,
+            Solution::min_moves_to_capture_the_queen(5, 3, 3, 4, 5, 2)
+        );
+    }
+}