A fly trapped inside a cubical box with side length meter decides to relieve its boredom by visiting each corner of the box. It will begin and end in the same corner and visit each of the other corners exactly once. To get from a corner to any other corner, it will either fly or crawl in a straight line. What is the maximum possible length, in meters, of its path?
This problem is copyrighted by the American Mathematics Competitions.
Instructions for entering answers:
For questions or comments, please email firstname.lastname@example.org.