/lit/ - Literature

>>15465496
>>15466017
>>15465999
Figured it out, and it is not complicated.
What you must realize is that the bug has two ways to get to B:
>climb across the top: 3.16
>climb across the side: 2.82
Since the bug will always take the shortest route, that means it will be 2.82.
Our problem then becomes one of optimization. There will always be two paths that go directly towards our goal, so the easiest way to figure this out is by finding a spot where both those paths are the same distance.
What I did here is laid out our three sides flat for easy geometry (we have six sides, but this box is symmetrical). I will call the sides O, P, and F. We must make it so that Path1=Path2.
Path1=(a^2+b^2)^.5=(c^2+d^2)^.5=Path2
I'll leave it up to you guys to figure out the rest as an exercise.