Best-candidateFor each new sample, the best-candidate algorithm generates a fixed number of candidates, shown in gray. (Here, that number is 10.) Each candidate is chosen uniformly from the sampling area. The best candidate, shown in red, is the one that is farthest away from all previous samples, shown in black.