The No Balance Assignment Problem (NBAP) is mainly resolved by changing it into Balance Assignment Problem (BAP) and using classical algorithm to deal with it now. This paper proposed Searching Best strategies Algorithm (SBSA) to resolve this problem, and it needn’t to change NBAP into BAP. SBSA resolves NBAP based on searching the best answer of the cost matrix. This algorithm’s theory is simple，and it is easy to operate. The result of the research indicate that the algorithm not only can deal with NBAP, but also can deal with BAP and other problems such as translation problem.