In randomized experiments, a single random allocation can yield groups that differ meaningfully with respect to a given covariate. Furthermore, it is only feasible to use classical control procedures of allocation for a very modest number of covariates. As a response to this problem, Morgan and Rubin [11, 12] proposed an approach based on rerandomization (repeated randomization) to ensure that the final allocation obtained is balanced. However, despite the benefits of the rerandomization method, it has an exponential computational cost in the number of covariates, for fixed balance constraints. Here, we propose the use of haphazard intentional allocation, an alternative allocation method based on optimal balance of the covariates extended by random noise, see Lauretto et al. . Our proposed method can be divided into a randomization and an optimization step. The randomization step consists of creating new (artificial) covariates according a specified distribution. The optimization step consists of finding the allocation that minimizes a linear combination of the imbalance in the original covariates and the imbalance in the artificial covariates. Numerical experiments on real and simulated data show a remarkable superiority of haphazard intentional allocation over the rerandomization method, both in terms of balance between groups and in terms of inference power.