CONO-SUR 1999 Problem 6
An ant walks across the floor of a circular path of radius and moves in a straight line, but sometimes stops. Each time it stops, before resuming the march, it rotates alternating the direction (if the last time it turned to its right, the next one does it to its left, and vice versa). Find the maximum possible length of the path the ant goes through. Prove that the length found is, in fact, as long as possible.
Figure: turn to the right .
Attachments:

Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.