TOPICS
Search

Fly Problem


The name fly problem may refer to either of two puzzles:

1. The spider and fly problem, which asks for the shortest route a spider can take over the surfaces of a cuboid to reach a fly, or

2. The two trains puzzle, which asks for the distance traveled by a fly moving back and forth between two approaching trains.


See also

Spider and Fly Problem, Two Trains Puzzle

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Fly Problem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/FlyProblem.html

Subject classifications