Question 81
A robot moves along the lines of an infinitely large square grid. It starts at an intersection and turns $90^\circ$ at each intersection it encounters. At some point it reaches its starting point without having visited any other point twice. What are the possible path lengths of the robot?