You want to conduct a tour of this museum:

A-B-C
| | |
D-E-F
| | |
G-H-I
| | |
J-K-L

You want to walk through all the hallways once. What would be the least amount of walking you would need to do (each hallway is a kilometer long) to cover all the hallways at least once? (You can start and stop anywhere.)

I have a path that overlaps only 4 hallways, but I have no way of knowing if that is the shortest.

Posted by Erik on 2004-06-04 09:18:16