6 files changed, 234 insertions, 0 deletions

diff --git a/rust/queen-attack/.exercism/metadata.json b/rust/queen-attack/.exercism/metadata.json
new file mode 100644
index 0000000..59f1f5d
--- /dev/null
+++ b/rust/queen-attack/.exercism/metadata.json
@@ -0,0 +1 @@
+{"track":"rust","exercise":"queen-attack","id":"bc9fc8da81f74a1995df9013b5c78e49","url":"https://exercism.io/my/solutions/bc9fc8da81f74a1995df9013b5c78e49","handle":"dyamon","is_requester":true,"auto_approve":false}
\ No newline at end of file
diff --git a/rust/queen-attack/.gitignore b/rust/queen-attack/.gitignore
new file mode 100644
index 0000000..db7f315
--- /dev/null
+++ b/rust/queen-attack/.gitignore
@@ -0,0 +1,8 @@
+# Generated by Cargo
+# will have compiled files and executables
+/target/
+**/*.rs.bk
+
+# Remove Cargo.lock from gitignore if creating an executable, leave it for libraries
+# More information here http://doc.crates.io/guide.html#cargotoml-vs-cargolock
+Cargo.lock
diff --git a/rust/queen-attack/Cargo.toml b/rust/queen-attack/Cargo.toml
new file mode 100644
index 0000000..ffb4cd8
--- /dev/null
+++ b/rust/queen-attack/Cargo.toml
@@ -0,0 +1,4 @@
+[package]
+edition = "2018"
+name = "queen-attack"
+version = "2.2.0"
diff --git a/rust/queen-attack/README.md b/rust/queen-attack/README.md
new file mode 100644
index 0000000..044e2cb
--- /dev/null
+++ b/rust/queen-attack/README.md
@@ -0,0 +1,107 @@
+# Queen Attack
+
+Given the position of two queens on a chess board, indicate whether or not they
+are positioned so that they can attack each other.
+
+In the game of chess, a queen can attack pieces which are on the same
+row, column, or diagonal.
+
+A chessboard can be represented by an 8 by 8 array.
+
+So if you're told the white queen is at (2, 3) and the black queen at
+(5, 6), then you'd know you've got a set-up like so:
+
+```text
+_ _ _ _ _ _ _ _
+_ _ _ _ _ _ _ _
+_ _ _ W _ _ _ _
+_ _ _ _ _ _ _ _
+_ _ _ _ _ _ _ _
+_ _ _ _ _ _ B _
+_ _ _ _ _ _ _ _
+_ _ _ _ _ _ _ _
+```
+
+You'd also be able to answer whether the queens can attack each other.
+In this case, that answer would be yes, they can, because both pieces
+share a diagonal.
+
+## Rust Installation
+
+Refer to the [exercism help page][help-page] for Rust installation and learning
+resources.
+
+## Writing the Code
+
+Execute the tests with:
+
+```bash
+$ cargo test
+```
+
+All but the first test have been ignored. After you get the first test to
+pass, open the tests source file which is located in the `tests` directory
+and remove the `#[ignore]` flag from the next test and get the tests to pass
+again. Each separate test is a function with `#[test]` flag above it.
+Continue, until you pass every test.
+
+If you wish to run all ignored tests without editing the tests source file, use:
+
+```bash
+$ cargo test -- --ignored
+```
+
+To run a specific test, for example `some_test`, you can use:
+
+```bash
+$ cargo test some_test
+```
+
+If the specific test is ignored use:
+
+```bash
+$ cargo test some_test -- --ignored
+```
+
+To learn more about Rust tests refer to the [online test documentation][rust-tests]
+
+Make sure to read the [Modules][modules] chapter if you
+haven't already, it will help you with organizing your files.
+
+## Further improvements
+
+After you have solved the exercise, please consider using the additional utilities, described in the [installation guide](https://exercism.io/tracks/rust/installation), to further refine your final solution.
+
+To format your solution, inside the solution directory use
+
+```bash
+cargo fmt
+```
+
+To see, if your solution contains some common ineffective use cases, inside the solution directory use
+
+```bash
+cargo clippy --all-targets
+```
+
+## Submitting the solution
+
+Generally you should submit all files in which you implemented your solution (`src/lib.rs` in most cases). If you are using any external crates, please consider submitting the `Cargo.toml` file. This will make the review process faster and clearer.
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/rust](https://github.com/exercism/rust) repository on GitHub is the home for all of the Rust exercises. If you have feedback about an exercise, or want to help implement new exercises, head over there and create an issue. Members of the rust track team are happy to help!
+
+If you want to know more about Exercism, take a look at the [contribution guide](https://github.com/exercism/docs/blob/master/contributing-to-language-tracks/README.md).
+
+[help-page]: https://exercism.io/tracks/rust/learning
+[modules]: https://doc.rust-lang.org/book/ch07-02-defining-modules-to-control-scope-and-privacy.html
+[cargo]: https://doc.rust-lang.org/book/ch14-00-more-about-cargo.html
+[rust-tests]: https://doc.rust-lang.org/book/ch11-02-running-tests.html
+
+## Source
+
+J Dalbey's Programming Practice problems [http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html](http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
diff --git a/rust/queen-attack/src/lib.rs b/rust/queen-attack/src/lib.rs
new file mode 100644
index 0000000..cbdc2c7
--- /dev/null
+++ b/rust/queen-attack/src/lib.rs
@@ -0,0 +1,36 @@
+#[derive(Debug)]
+pub struct ChessPosition {
+    rank: i32,
+    file: i32,
+}
+
+#[derive(Debug)]
+pub struct Queen {
+    pos: ChessPosition,
+}
+
+fn in_range<T: Ord>(n: T, min: T, max: T) -> bool {
+    min <= n && n < max
+}
+
+impl ChessPosition {
+    pub fn new(rank: i32, file: i32) -> Option<Self> {
+        if in_range(rank, 0, 8) && in_range(file, 0, 8) {
+            Some(ChessPosition { rank, file })
+        } else {
+            None
+        }
+    }
+}
+
+impl Queen {
+    pub fn new(pos: ChessPosition) -> Self {
+        Queen { pos }
+    }
+
+    pub fn can_attack(&self, other: &Queen) -> bool {
+        self.pos.file == other.pos.file
+            || self.pos.rank == other.pos.rank
+            || (self.pos.rank - other.pos.rank).abs() == (self.pos.file - other.pos.file).abs()
+    }
+}
diff --git a/rust/queen-attack/tests/queen-attack.rs b/rust/queen-attack/tests/queen-attack.rs
new file mode 100644
index 0000000..9eea61b
--- /dev/null
+++ b/rust/queen-attack/tests/queen-attack.rs
@@ -0,0 +1,78 @@
+use queen_attack::*;
+
+#[test]
+fn chess_position_on_the_board_is_some() {
+    assert!(ChessPosition::new(2, 4).is_some());
+}
+
+#[test]
+fn chess_position_off_the_board_is_none() {
+    assert!(ChessPosition::new(-1, 2).is_none());
+
+    assert!(ChessPosition::new(8, 2).is_none());
+
+    assert!(ChessPosition::new(5, -1).is_none());
+
+    assert!(ChessPosition::new(5, 8).is_none());
+}
+
+#[test]
+fn queen_is_created_with_a_valid_position() {
+    Queen::new(ChessPosition::new(2, 4).unwrap());
+}
+
+#[test]
+fn queens_that_can_not_attack() {
+    let white_queen = Queen::new(ChessPosition::new(2, 4).unwrap());
+    let black_queen = Queen::new(ChessPosition::new(6, 6).unwrap());
+
+    assert!(!white_queen.can_attack(&black_queen));
+}
+
+#[test]
+fn queens_on_the_same_rank_can_attack() {
+    let white_queen = Queen::new(ChessPosition::new(2, 4).unwrap());
+    let black_queen = Queen::new(ChessPosition::new(2, 6).unwrap());
+
+    assert!(white_queen.can_attack(&black_queen));
+}
+
+#[test]
+fn queens_on_the_same_file_can_attack() {
+    let white_queen = Queen::new(ChessPosition::new(4, 5).unwrap());
+    let black_queen = Queen::new(ChessPosition::new(3, 5).unwrap());
+
+    assert!(white_queen.can_attack(&black_queen));
+}
+
+#[test]
+fn queens_on_the_same_diagonal_can_attack_one() {
+    let white_queen = Queen::new(ChessPosition::new(2, 2).unwrap());
+    let black_queen = Queen::new(ChessPosition::new(0, 4).unwrap());
+
+    assert!(white_queen.can_attack(&black_queen));
+}
+
+#[test]
+fn queens_on_the_same_diagonal_can_attack_two() {
+    let white_queen = Queen::new(ChessPosition::new(2, 2).unwrap());
+    let black_queen = Queen::new(ChessPosition::new(3, 1).unwrap());
+
+    assert!(white_queen.can_attack(&black_queen));
+}
+
+#[test]
+fn queens_on_the_same_diagonal_can_attack_three() {
+    let white_queen = Queen::new(ChessPosition::new(2, 2).unwrap());
+    let black_queen = Queen::new(ChessPosition::new(1, 1).unwrap());
+
+    assert!(white_queen.can_attack(&black_queen));
+}
+
+#[test]
+fn queens_on_the_same_diagonal_can_attack_four() {
+    let white_queen = Queen::new(ChessPosition::new(2, 2).unwrap());
+    let black_queen = Queen::new(ChessPosition::new(5, 5).unwrap());
+
+    assert!(white_queen.can_attack(&black_queen));
+}