More on the minimality of search paths under continuous univariate distributions

A searcher looks for a stationary target on a line. The target’s position is given by a probability and it may be in either direction of some starting point. A search path is a sequence of many turning points. The main interest is in minimizing the expected search time needed to detect the target. In a previous paper the author has established sufficient conditions that guarantee the minimality of search paths under absolutely continuous target distributions. The purpose of this paper is to relax these sufficient conditions.