I just got the below question in GS phone screening round:

You are given a NXN chessboard. Find if it is possible to reach a point (m,n) starting from (p,q) USING ONLY KNIGHT MOVES.

Follow Up : Find MINIMUM number of moves to do so.

Can anyone explain how to approach this problem ? Interviewer wanted to avoid using graphs to solve this.

Thanks