Introduction - If you have any usage issues, please Google them yourself
In a 2-dimensional grid/plane (n*m)
there are either walls or spaces.
We represent the walls as ‘# ’ in the
diagram (with spaces coloured into
different partitions)
In such a grid we can place robots who can move horizontally and vertically but
cannot move on top of a wall.
You need to calculate the minimum number of robots that are needed in order to
be able to visit all spaces in the grid.