Abstract We consider a one-dimensional Brownian search in the presence of trapping. The diffusion equation particle is represented by memory kernel that enters general waiting time probability density function. find form first arrival density, reliability and efficiency analyze several special cases kernel. also Lévy trapping single multiple targets, as well combined Lévy–Brownian strategies ca...