Leap, Difference of Squares, Grains, Collatz Conjecture, Queen Attack, Darts, Hamming, and Space Age completed yesterday. Binary and Linked List completed today. |
||
---|---|---|
.. | ||
.exercism | ||
test-framework | ||
HELP.md | ||
makefile | ||
queen_attack.c | ||
queen_attack.h | ||
README.md | ||
test_queen_attack.c |
Queen Attack
Welcome to Queen Attack on Exercism's C Track.
If you need help running the tests or submitting your code, check out HELP.md
.
Instructions
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:
_ _ _ _ _ _ _ _
_ _ _ _ _ _ _ _
_ _ _ 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.
Source
Created by
- @RealBarrettBrown
Contributed to by
- @bcc32
- @h-3-0
- @patricksjackson
- @QLaille
- @ryanplusplus
- @wolf99
Based on
J Dalbey's Programming Practice problems - http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html