Motion Planning

Motion Planning
A robot needs to visit an area of nxn squares. However, its movement is restricted to liner mobility. Additionally, it is not allowed to pass a square that poses an obstacle. The robot is allowed to visit the same square more than once. Count how many square the robot visited more than once, the visit count, and the number of visited and non-visited un-blocked squares.
Consider various cases:
1) all squares are non-blocked
2) one square (one blocked square)
3) more than one blocked square
4) a square surrounded by blocked square.

Questions by nsaliza4


This Question is not yet answered!


Related Answered Questions


Related Open Questions