If a robot with speed $1$ runs the zig$-$zag algorithm with growth rate r $>1$ and after t changes in direction, returns to the starting position and has not found the exit then it would have traversed a total distance of