SCHWEITZER 1995 Problem 9
A serpentine is a sequence of points in a plane, not necessarily all different, such that the distance between and is at least 1, and the segments are alternately horizontal and vertical. Construct a compact set in which there is a sequence of serpentines with arbitrary long lengths but there is no closed serpentine ( for some i < m).
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.