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.)

(In reply to Solution by Jer)

While your solution is good, i don't agree with your first statement.

firstly, I believe a network is traversable if it has 2 ODD nodes, of which 1 must be a single if EVEN nodes are also the network.

secondly, if a network has no ODD nodes it is always traversable.

Posted by Juggler on 2004-06-04 09:42:59