A robot moves along the lines of an infinitely large square grid. It starts at an intersection and turns 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?
Baltic Way Shortlist, 2023
Solution
Solution: See Solution of C2.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.