  The design of uniformly spread sequences on $[0,1)$ has been extensively
studied since the work of Weyl and van der Corput in the early $20^{\text{th}}$
century. The current best sequences are based on the Kronecker sequence with
golden ratio and a permutation of the van der Corput sequence by Ostromoukhov.
Despite extensive efforts, it is still unclear if it is possible to improve
these constructions further. We show, using numerical experiments, that a
radically different approach introduced by Kritzinger in seems to perform
better than the existing methods. In particular, this construction is based on
a \emph{greedy} approach, and yet outperforms very delicate number-theoretic
constructions. Furthermore, we are also able to provide the first numerical
results in dimensions 2 and 3, and show that the sequence remains highly
regular in this new setting.
