The search designs first introduced in Srivastava (1975) is reviewed. In a ceritan problem, there may be some search designs with same runs. Some criteria for evaluation of search designs are the other topic in the paper. Criteria based on searching probability and expected Kullback- Leibler are reviewd. Some examples are given in each case.