Optimal Running Path Around a Triangular House

⚡ Key Takeaways

One-line statement: Given a triangular house and a runner who starts at a point, must touch each of the three walls (sides), and return to start, the optimal (shortest) running path is found using reflection of the starting point across the walls. Key result: When the runner must touch all three sides in order and return, the minimal closed path is a straight line in the unfolded (reflected) plane; for the special case of touching each side once the inscribed path is governed by reflection and, for the triangle-inscribed-triangle problem, by the orthic triangle. Where it applies: Optimization, geometric reflection ("billiard") problems, the calculus of shortest paths, recreational and competition mathematics. Who/when: Rooted in Heron of Alexandria (c. 60 AD) on reflection; Fagnano's inscribed-triangle problem (1775); modern billiard dynamics.

💡 The Core Insight

A path that bounces off a wall obeys the law of reflection (angle in = angle out) precisely when it is shortest. Equivalently, reflecting the start point across a wall turns "go to the wall then continue" into "go straight to the mirror image." Chain these reflections and the optimal multi-touch path becomes a single straight segment in an unfolded copy of the plane.

DefinitionThe Triangular House Running Problem

Let triangle $\triangle ABC$ represent the house, with side lengths $a = BC$ , $b = CA$ , $c = AB$ . A runner located at point $P$ must touch a sequence of walls and return to $P$ . We measure the total path length $L$ and seek its minimum. Two canonical versions exist:

(V1) Fixed start, return to start, touch one wall: Touch line $\ell$ once and come back; minimize $L = |PX| + |XP'|$ -type sums.
(V2) Inscribed triangle / full lap: Choose one point on each side, $X \in BC$ , $Y \in CA$ , $Z \in AB$ , and run the closed loop $X \to Y \to Z \to X$ . Minimize the perimeter

1

\quad L(X,Y,Z) = |XY| + |YZ| + |ZX|.

Derivation hint: This is just the perimeter of inscribed triangle $\triangle XYZ$ ; the optimization is over the three free points constrained to the sides.

DefinitionReflection of a Point Across a Line

Given a point $P$ and a line $\ell$ , the reflection $P'$ satisfies: $\ell$ is the perpendicular bisector of segment $PP'$ . The key distance-preserving property is, for any point $X$ on $\ell$ ,

2

\quad |PX| = |P'X|.

Derivation hint: $X$ lies on the perpendicular bisector $\ell$ of $PP'$ , and any point on a perpendicular bisector is equidistant from the two endpoints.

TheoremReflection Principle for Shortest Touch-Path

For version (V1), the runner starting at $P$ , touching line $\ell$ at point $X$ , and continuing to a target $Q$ , minimizes total distance $|PX| + |XQ|$ when

3

\quad |PX| + |XQ| = |P'Q|,

achieved exactly when $X$ lies on the straight segment $P'Q$ , where $P'$ is the reflection of $P$ across $\ell$ . The optimal $X$ obeys the law of reflection: the incoming and outgoing rays make equal angles with $\ell$ . Derivation hint: Replace $|PX|$ with $|P'X|$ using equation [2]; then $|P'X| + |XQ| \ge |P'Q|$ by the triangle inequality, with equality iff $X$ on segment $P'Q$ .

TheoremFagnano–Fejér: Minimal Inscribed Triangle

For an acute triangle $\triangle ABC$ , version (V2)'s minimum-perimeter inscribed triangle is the orthic triangle $\triangle X_0Y_0Z_0$ , whose vertices are the feet of the three altitudes. Its perimeter is

4

\quad L_{\min} = 2A_{\triangle} \cdot \frac{?}{?} \;=\; a\cos A + b\cos B + c\cos C,

equivalently expressible as $L_{\min} = (a\cos A + b\cos B + c\cos C)$ , and the orthic triangle's sides satisfy a reflection (equal-angle) condition at each touch point. Derivation hint: Each side of the orthic triangle reflects off the host triangle's wall at equal angles — the same "billiard" condition forced by [3]; Fejér's double-reflection unfolding shows this is the global minimum.

ProofReflection gives the shortest single-wall touch (V1)

Setup. Runner at $P$ , target $Q$ , both on the same side of wall line $\ell$ . We must pick the touch point $X \in \ell$ minimizing $f(X) = |PX| + |XQ|$ .

Step 1. Reflect $P$ across $\ell$ to get $P'$ . By equation [2], for every candidate $X$ on $\ell$ ,

|PX| = |P'X|.

Step 2. Substitute:

f(X) = |P'X| + |XQ|.

Step 3. $P'$ and $Q$ lie on opposite sides of $\ell$ (reflection flips the side). The triangle inequality gives

|P'X| + |XQ| \ge |P'Q|,

with equality iff $X$ lies on the straight segment $P'Q$ .

Step 4. Since segment $P'Q$ crosses $\ell$ exactly once, there is a unique optimal touch point $X_0 = P'Q \cap \ell$ , and the minimum length is $|P'Q|$ , matching equation [3].

Step 5 (equal-angle condition). Because $\angle(P'X_0, \ell)$ equals $\angle(P X_0, \ell)$ (reflection preserves angles) and $P', X_0, Q$ are collinear, the angle of incidence equals the angle of reflection. $\blacksquare$

∎

ProofFejér's reflection argument for the orthic minimum (V2, acute case)

Step 1 — fix one vertex. Temporarily fix $X$ on side $BC$ . We optimize the broken path $X \to (\text{side } CA) \to (\text{side } AB) \to X$ .

Step 2 — double reflection. Reflect $X$ across line $CA$ to get $X_1$ , and across line $AB$ to get $X_2$ . By equation [2], the path length equals $|X_1 Y| + |YZ| + |ZX_2|$ , which for fixed $Y,Z$ -freedom straightens to $|X_1 X_2|$ — a straight segment.

Step 3 — the key length identity. Both reflections fix distance to vertex $A$ , so $|AX_1| = |AX_2| = |AX|$ , and the angle $\angle X_1 A X_2 = 2A$ (twice the angle at $A$ , independent of $X$ ). Hence

5

\quad |X_1 X_2| = 2|AX|\sin A.

Derivation hint: $\triangle X_1 A X_2$ is isosceles with apex angle $2A$ and equal legs $|AX|$ ; drop the apex bisector to get the base $= 2|AX|\sin A$ .

Step 4 — minimize over $X$ . Since $\sin A$ is constant, $|X_1 X_2|$ is smallest when $|AX|$ is smallest, i.e. when $AX \perp BC$ . So $X$ is the foot of the altitude from $A$ .

Step 5 — symmetry closes the loop. Repeating for $B$ and $C$ forces $Y, Z$ to be the other two altitude feet. The simultaneous minimizer is exactly the orthic triangle, and at each side the equal-angle (reflection) law from [3] holds. $\blacksquare$

∎

⚠️ Common mistake

The orthic-triangle result holds only for acute triangles. If $\triangle ABC$ is right or obtuse, the minimum "inscribed triangle" degenerates: the infimum perimeter approaches $2h$ (twice the shortest altitude) but is not attained by a genuine triangle. Always check the triangle is acute before invoking equation [4].

Figure

Reflection unfolding: the bounce path straightens into a line

Caption: The actual bounce $P \to X \to Q$ (gold) has the same length as the straight dashed segment $P'Q$ , where $P'$ is $P$ reflected across the wall. Equal incidence/reflection angles emerge automatically.

HO

Heron of Alexandria

c. 10–70 AD

Heron first proved that light reflecting off a mirror takes the shortest path, establishing the equal-angle law via a geometric (reflection) argument — the exact tool that solves the running-around-the-house problem. His insight predated the modern variational principle by over 1500 years and reframed an optics fact as a pure minimization, the conceptual seed of every "billiard path" result here.

🧠 Intuition

Imagine standing at $P$ inside a mirrored room; you throw a ball that must bounce off one wall and reach a friend at $Q$ . The ball "wants" the straightest route. Through the mirror, the friend's image $Q$ (or your image $P'$ ) appears behind the wall, and the straight line of sight to that image marks where the ball must strike. Running around a triangular house is the same trick chained three times: each wall is a mirror, and "unfolding" the triangle by repeated reflection turns the zigzag lap into one straight ruler-line. The optimal touch points are simply where that ruler-line crosses each wall.

ExampleSingle-wall touch with numbers

Given: Runner at $P = (1, 3)$ , water tap (target) at $Q = (7, 5)$ , both above the wall along the $x$ -axis ( $\ell: y=0$ ). Find the optimal touch point $X$ and minimal distance.

Step 1 — Reflect $P$ : $P' = (1, -3)$ .

Step 2 — Minimal length:

L_{\min} = |P'Q| = \sqrt{(7-1)^2 + (5-(-3))^2} = \sqrt{36 + 64} = \sqrt{100} = 10.

Step 3 — Touch point (where segment $P'Q$ meets $y=0$ ). Parametrize: $x = 1 + 6t$ , $y = -3 + 8t$ . Set $y=0 \Rightarrow t = 3/8$ . Then $x = 1 + 6(3/8) = 1 + 2.25 = 3.25$ .

\boxed{X = (3.25,\ 0), \qquad L_{\min} = 10 \text{ units}}

ExampleOrthic-triangle lap of an acute house

Given: An acute triangular house with angles $A = 80^\circ$ , $B = 60^\circ$ , $C = 40^\circ$ and sides $a = 10\text{ m}$ , $b = 8.79\text{ m}$ , $c = 6.53\text{ m}$ (consistent with the Law of Sines). Find the minimal lap length (orthic-triangle perimeter) using equation [4].

Step 1 — Compute each term $s_i = (\text{side})\cos(\text{opposite angle})$ :

a\cos A = 10\cos 80^\circ = 10(0.17365) = 1.7365,

b\cos B = 8.79\cos 60^\circ = 8.79(0.5) = 4.395,

c\cos C = 6.53\cos 40^\circ = 6.53(0.76604) = 5.0023.

Step 2 — Sum:

L_{\min} = 1.7365 + 4.395 + 5.0023 = 11.134 \text{ m}.

\boxed{L_{\min} \approx 11.13 \text{ m (orthic-triangle minimal lap)}}

Sanity check: Each wall is touched at the foot of an altitude, and at each touch the incoming/outgoing run angles are equal — the billiard condition.

⚠️ Common mistake

"The shortest lap touches the midpoints of the sides (the medial triangle)." False. The medial triangle has perimeter equal to half the house's perimeter and does not satisfy the equal-angle reflection law; it is generally longer than the orthic triangle. The minimizer is the orthic triangle (altitude feet), not the medial triangle (side midpoints).

CounterexampleObtuse house breaks the formula

Take $\triangle ABC$ with $A = 120^\circ$ , $B = 40^\circ$ , $C = 20^\circ$ . Here $\cos A = \cos 120^\circ = -0.5 < 0$ , so equation [4] would yield a negative contribution from the $a\cos A$ term — a sign that no genuine minimal inscribed triangle exists. Geometrically, the altitude foot from the obtuse vertex lands outside the triangle, so the orthic "triangle" is not inscribed. The infimum perimeter slides toward $2h_{\min}$ (twice the shortest altitude) but is never realized; the optimal "path" degenerates to a back-and-forth along that altitude.

connection

This problem is the elementary face of Billiard Dynamics: a frictionless ball in a triangular table follows exactly the equal-angle reflections derived here, and the orthic triangle is the unique closed billiard orbit of period 3 in an acute triangle. It rests on the Triangle Inequality (the engine of every shortest-path argument) and on Reflections and Isometries. The minimization-by-unfolding is the discrete cousin of Fermat's Principle of Least Time in optics and a baby version of the Calculus of Variations. The altitude feet tie it to The Orthocenter and Altitudes.

🔬 Where this appears

⏳ History

- c. 60 AD — Heron of Alexandria proves the equal-angle reflection law as a minimization, founding the shortest-bounce idea.

- 1657 — Pierre de Fermat formulates the principle of least time, generalizing Heron to refraction and giving variational legitimacy to reflection paths.

- 1775 — Giovanni Fagnano poses and solves (via calculus) the inscribed-triangle minimal-perimeter problem, identifying the orthic triangle for acute triangles.

- 1900s — Lipót Fejér supplies the celebrated elementary double-reflection proof (reproduced above), removing the calculus and revealing the geometry.

- 1924 — George Birkhoff develops the theory of dynamical billiards, placing triangular reflection orbits in a rigorous dynamical-systems frame.

- 1940s — Richard Courant & Herbert Robbins popularize the reflection/orthic argument in What Is Mathematics?, making it a standard expository gem.

- 1960s–70s — Billiard research (Sinai and others) connects period-3 orbits and the orthic triangle to ergodic theory.

- Present — The triangular-billiard problem remains a live test case for periodic-orbit existence in non-acute and irrational-angle triangles.

open-problem

The acute case is fully solved, but the general triangular billiard problem is famously hard: it is unknown whether every obtuse (and in particular every irrational-angle) triangle admits a closed billiard orbit at all. While right and obtuse triangles defeat the orthic-triangle minimizer, the existence of any periodic running path that touches the walls and returns is open for large classes of obtuse triangles — a striking gap given how elementary the acute case appears. The "shortest lap" thus transitions from a clean high-school exercise to an unresolved frontier of dynamical systems the moment the largest angle exceeds $90^\circ$ .

Optimal Running Path Around a Triangular House

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also