KöMaL 2018 B4943
There is an ant at each corner of a given face of a rectangular brick. Each ant wants to get to the opposite vertex of the cuboid, that is, to the other endpoint of the space diagonal drawn from his vertex of the cuboid. Is it possible for the ants to crawl to the opposite vertices along the surface of the brick, so that they follow the shortest possible paths and their paths do not intersect?
Official text KöMaL. 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.