Question 9
The robot wants to reach the ball (the circle). On each step it may move up, down, left or right. It may not move diagonally or enter a black square.
What is the smallest number of squares it must pass through, excluding the first and last squares?
What is the smallest number of squares it must pass through, excluding the first and last squares?