Move Knights

CodeChefOpen on judge ↗

Given a 8 x 8 standard chess board , and two positions in the board ,starting and ending position , calculate the shortest number of moves required to take a knight from the starting to the ending postions. Refer to this link for the movements of knight ,incase you are not sure. Positions are denoted by this notation . Input First Line denotes the starting square Second Line denotes the endin

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