There is an $8 imes 8$ chessboard containing three pieces:

• A white rook at coordinates (a, b)

• A white bishop at coordinates (c, d)

• A black queen at coordinates (e, f)

In each move, you may move either the white rook or the white bishop according to standard chess rules:

• The rook can move any number of squares horizontally or vertically, but cannot jump over any piece.

• The bishop can move any number of squares diagonally, but cannot jump over any piece.

• The black queen does not move.

Return the minimum number of moves required for either the white rook or the white bishop to capture the black queen.

Constraints:

• $1 \leq$ a, b, c, d, e, f $\leq 8$

• No two pieces are on the same square.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.