Brachistochrone Gradient Flow
Watch a rough guessed path relax, step by step, into the true brachistochrone curve as gradient descent minimizes the descent-time functional directly -- the numerical method behind the calculus of variations, not a race between named curves.
Instead of racing pre-named curves against each other, this simulation solves the brachistochrone problem the way calculus of variations actually works: it discretizes the descent-time functional T[y] over a free path of movable points, computes its numerical gradient, and lets steepest descent relax an arbitrary guessed curve — straight, bulged, or zigzagged — step by step into the true minimum-time path. A dashed overlay of the closed-form cycloid solution, refit live as you move the endpoint, lets you watch the gap between guess and optimum close in real time, with the functional's value and an RMS convergence readout tracking the process exactly as an optimizer would.
Watch a roughly guessed path relax, step by step, into the true brachistochrone curve as numerical gradient descent minimizes the descent-time functional directly -- the method behind the calculus of variations, shown in action instead of a race between named curves.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install