in the past decade computer science literature has studied the effect of introducing random choices to classical processes. for example, sequentially place n balls into n bins. for each ball, two bins are sampled uniformly and the ball is placed in the emptier of the two. this process does a much better job of evenly distributing the balls than the "choiceless" version where one places each ball uniformly. consider the continuous version: form a random sequence in the unit interval by having the n*th* term be whichever of two uniformly placed points falls in the larger gap between the previous n-1 points. i'll confirm the intuition that this sequence is a.s. equidistributed, solving an open problem from itai benjamini, pascal maillard and elliot paquette. the history goes back a century to weyl and more recently to kakutani. several open problems will be discussed.