![](/images/perplexus/problem/flycube.gif)
Consider the cube shown (assume for argument's sake that it's a perfect cube, contraty to what the picture may look like).
A fly, sitting in the vertex (A) of this cube must travel the surface of the cube until it arrives at the vertex (G).
If the fly cannot leave the surface of the cube, what is the shortest path for the fly to take between the two points?
(In reply to
no math needed by rixar)
in fact, whatever the combination of a face diagonal and edge leading toward the G-spot(ironic isn't it?) would make the fly happy(very happy)
|
Posted by vije
on 2004-07-02 14:51:49 |