Q.9 In the square grid shown on the left, a person standing at P2 position is required to move to P5 position. The only movement allowed for a step involves, “two moves along one direction followed by one move in a perpendicular direction”. The permissible directions for movement are shown as dotted arrows in the right. For example, a person at a given position Y can move only to the positions marked X on the right. Without occupying any of the shaded squares at the end of each step, the minimum number of steps required to go from P2 to P5 is (A) 4 (B) 5 (C) 6 (D) 7

Q.9 In the square grid shown on the left, a person standing at P2 position is required
to move to P5 position.
The only movement allowed for a step involves, “two moves along one
direction followed by one move in a perpendicular direction”. The permissible
directions for movement are shown as dotted arrows in the right.
For example, a person at a given position Y can move only to the positions
marked X on the right.
Without occupying any of the shaded squares at the end of each step, the
minimum number of steps required to go from P2 to P5 is

(A) 4
(B) 5
(C) 6
(D) 7

Minimum Knight-Move Steps from P2 to P5 on Grid Without Shaded Squares

Introduction

In logic puzzles involving restricted movement, calculating path length correctly is vital. In this problem, we determine the minimum number of steps from P2 to P5 on a 5×5 grid, avoiding shaded squares and obeying a fixed movement rule similar to a knight in chess.

Problem Summary

  • Start: P2 (Row P, Column 2)
  • End: P5 (Row P, Column 5)
  • Allowed Move: Two squares in one direction + One square perpendicular
  • Constraint: Cannot land on shaded squares

The movement acts like a chess knight, but landing on shaded cells or leaving the grid is not allowed.

Step-by-Step Valid Path

One shortest valid path avoiding shaded squares is:

  1. P2 → Q4
  2. Q4 → R2
  3. R2 → S4
  4. S4 → Q5
  5. Q5 → P5

✔ Reaches destination in 5 steps
✔ Does not land on dark blocks
✔ Respects the 2+1 movement rule

Correct Answer

Minimum steps required = 5

Why Other Options Are Incorrect

Option (A) 4

No legal sequence of four moves reaches P5 safely. Any 4-step attempt hits shaded squares or stops short.

Option (B) 5 – Correct

At least one safe 5-step path exists. No shorter route is possible.

Option (C) 6

A 6-step route exists but is not the minimum.

Option (D) 7

Also possible with unnecessary detours, longer than needed.

Conclusion

This grid puzzle highlights planning and pathfinding. By following knight-like moves and avoiding shaded obstacles, the shortest route from P2 to P5 takes exactly five steps, making Option (B) the correct choice.

 

Leave a Reply

Your email address will not be published. Required fields are marked *

Latest Courses