There is a chessboard of size N×M and starting position (sx, sy) and destination position (dx,dy). You have to find out how many minimum numbers of moves a knight goes to that destination position?
belongs to collection: Interview C++ coding problems/challenges | Graph
All Answers
total answers (1)
Algorithm:
To solve this problem we follow this approach:
C++ Implementation for Knight walk problem
Output
need an explanation for this answer? contact us directly to get an explanation for this answer