Correct option is B
Given:
- An 8 × 8 chessboard (rows and columns)
- A move is defined as:
- 2 steps in one direction (row or column) and 1 step in the other direction
This is exactly like a knight's move in chess:
- Moves either (2,1) or (1,2) in any direction.
We need to find the minimum number of such moves from one corner to the diagonally opposite corner, i.e., from (1,1) to (8,8).
Concept Used:
- A knight moves in L-shape: 2 steps in one direction and 1 step in the other
- Knight move on an 8×8 board from one corner to the opposite has a known minimum move count
- Use BFS logic or standard result
Solution:
From chess logic and standard shortest-path knowledge, the minimum number of knight moves from one corner to the opposite (like from A1 to H8) on an 8×8 board is:
6 moves
Correct Option: (B) 6
