Question 13
A robot is in a unit square of a table. When the robot moves on the table, it cannot move diagonally. For example, in the diagram below, $R$ is the location of the robot to start and the robot needs to move 5 squares to reach the square marked by $G$.
In the following table, there are 12 squares (marked with $R$) starting from which the robot takes up to 5 squares to reach each of the two shaded squares.
Now, there are 6 shaded squares in the following table. How many squares, except the shaded squares, are there so that it takes the robot up to 4 squares to reach at least two of the shaded squares?
In the following table, there are 12 squares (marked with $R$) starting from which the robot takes up to 5 squares to reach each of the two shaded squares.
Now, there are 6 shaded squares in the following table. How many squares, except the shaded squares, are there so that it takes the robot up to 4 squares to reach at least two of the shaded squares?