This paper proposes a heuristic for planning a distributed search that yields an exhaustive enumeration. The paper is motivated by the need to search for binary extremal self-dual codes. The proposed technique represents the search space as an image. A partial image is obtained by a preliminary sampling of the search space. We propose an image restoration algorithm which can be applied on the partial image in order to identify regions of interest, and prioritize the search accordingly. Experimental results show that the technique can guide the search effectively.