Online minimum search for a Brownian bridge

In this short note we consider the computational problem of numerically finding the minimum and arg-min of a Brownian bridge. Using well-known results by Pitman, Tanaka, Vervaat and Williams we are able to show that the bisection method has both a small error and a small probability of failure.