A Minesweeper Path Length
Problem
An engineer uses a detector, with effective range km, to sweep for mines in an equilateral triangular region of side length km. Starting from one vertex of the triangle, what is the minimum distance the engineer must walk to complete the sweep? Justify your answer.
Answer
Solution
| Difficulty | 8/10 |
|---|---|
| Topics | plane geometry, Extrema, Reflection, analytic geometry |
Whiteboard
Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.
Discussion
Ask questions, share alternate solutions, and use LaTeX freely.
Log in to join the discussion.
No comments yet.