Minimum Moves to Capture The Queen
There is a 1-indexed 8 x 8 chessboard containing 3 pieces.
You are given 6 integers a, b, c, d, e, and f where:
(a, b)denotes the position of the white rook.(c, d)denotes the position of the white bishop.(e, f)denotes the position of the black queen.
Given that you can only move the white pieces, return the minimum number of moves required to capture the black queen.
Note that:
- Rooks can move any number of squares either vertically or horizontally, but cannot jump over other pieces.
- Bishops can move any number of squares diagonally, but cannot jump over other pieces.
- A rook or a bishop can capture the queen if it is located in a square that they can move to.
- The queen does not move.
Example 1
Input
a = 1, b = 1, c = 8, d = 8, e = 2, f = 3Output
2We can capture the black queen in two moves by moving the white rook to (1, 3) then to (2, 3), and it is impossible in less because the queen is not initially attacked.
Example 2
Input
a = 5, b = 3, c = 3, d = 4, e = 5, f = 2Output
1The black queen can be captured in a single move by moving either the white rook or the white bishop to (5, 2).
Constraints
- 1 <= a, b, c, d, e, f <= 8
- No two pieces are on the same square.