[Solution] Journey of the Knight CodeChef Solution

[Solution] Journey of the Knight CodeChef Solution 2022

Chef has an 8×8$8\times 8$ chessboard. He placed a knight on the square (X1,Y1)$(X_1,Y_1)$. Note that, the square at the intersection of the ith$i^{th}$ row and jth$j^{th}$ column is denoted by (i,j)$(i,j)$.

Chef wants to determine whether the knight can end up at the square (X2,Y2)$(X_2,Y_2)$ in exactly 100$100$ moves or not.

For reference, a knight can move to a square which is:

• One square horizontally and two squares vertically away from the current square, or
• One square vertically and two squares horizontally away from the current square

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

A visual description of this may be found here.

Input Format

• The first line contains a single integer T$T$ — the number of test cases. Then the test cases follow.
• The first and only line of each test case contains 4$4$ integers X1,Y1,X2,Y2$X_1,Y_1,X_2,Y_2$ — where (X1,Y1)$(X_1,Y_1)$ denotes the starting square of the knight and (X2,Y2)$(X_2,Y_2)$ denotes the ending square of the knight.

Output Format

For each test case, output YES if knight can move from (X1,Y1)$(X_1,Y_1)$ to (X2,Y2)$(X_2,Y_2)$ in exactly 100$100$ moves. Otherwise, output NO.

Bidding CodeChef Solution 

Pass the Exam CodeChef Solution

Chef and Candies CodeChef Solution

Journey of the Knight CodeChef Solution

Slow Solution CodeChef Solution 

Game of Piles Version 1 CodeChef Solution

Find A, B, C CodeChef Solution

Largest Square in the garden CodeChef Solution

Game of Piles Version 2 CodeChef Solution

You may print each character of YES and NO in uppercase or lowercase (for example, yes, yEs, Yes will be considered identical).

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤X1,Y1,X2,Y2≤8