Problem:
Given a lattice of regular hexagons. A bug crawls from vertex to vertex along edges of the hexagons, taking the shortest possible path (or one of them). Prove that it travels a distance at least in one direction. If it travels exactly in one direction, how many edges does it traverse?
Solution
Solution:

Suppose vertex is that marked at the bottom left. Without loss of generality, is in a degree sector as shown. Assume the edges have unit length. The vertices can be partitioned into two sets (marked and in the diagram). Each set forms a skewed lattice with axes at degrees. Any path must alternate between the two lattices.
If is on the same lattice as , then we can give coordinates relative to and the shortest path from to must move units east and units east of north. The shortest path between a lattice point and the next lattice point east is evidently one edge in direction followed by one edge in direction . Similarly, the shortest path between a lattice point and the next lattice point east of north is one edge in direction , followed by one edge in direction . So a shortest path from to must have edges in direction .
is a distance east of and a distance north of , so . So in this case the bug must travel more than in direction .
Now suppose is on the other lattice. Let be the lattice point immediately north of and the lattice point in direction from . Then a shortest path from to must either be to and then a shortest path from to , or to and then a shortest path from to . Take to have coordinates relative to or .
In the first case, and a shortest path has units in direction . But , if , which is true for at least . If and , then a shortest path has units in direction and . If and , then and a shortest path has unit in each direction. So in this case (the only one so far) we have equality.
It remains to consider the case where the path starts out towards . In this case and a path has units in direction . But for , which is true for at least . If , , then a shortest path has units in direction and . Finally, if and , then a shortest path has unit in each direction and .
Thus the answer to the final question is , because the only cases where the bug travels exactly in one direction are where it goes to the opposite vertex of a hexagon it is on.