Since introduction of search design by Srivastava(1975), construction of it has been done by many researchers for 2m factorial experiments. One of the main goals in construction of the search design is obtaining a design with a highly structured small set of runs. The coherent structure allows for generalization of the searching property for all m. In this paper we obtain a highly structured search design with smaller number of runs than the former ones for all 2m factorial experiments, m > 3.
