Lévy flights do not always optimize random blind search for sparse targets

It is shown that for close targets and for downstream target positioning regular Brownian motion turns out to be the advantageous search strategy, contrary to claims that Lévy flights with a critical exponent α = 1 are optimal for the search of sparse targets in different settings.