Journey of the Knight Solution Codechef

Journey of the Knight Solution Codechef Chef has an 8×8 chessboard. He placed a knight on the square (X1,Y1). Note that, the square at the intersection of the ith row and jth column is denoted by (i,j). Chef wants to determine whether the knight can end up at the square (X2,Y2) in exactly 100 moves or not. For reference, a knight can move to a square which is: One … Read more