← All problemsSign in

New Piece

CodeChefRating 1216Open on judge ↗

Chef's favorite game is chess. Today, he invented a new piece and wants to see its strengths. From a cell $(X, Y)$, the new piece can move to any cell of the chessboard such that its color is different from that of $(X, Y)$. The new piece is currently located at cell $(A, B)$. Chef wants to calculate the minimum number of steps required to move it to $(P, Q)$. **Note:** A chessboard is an $8 \t

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start