Abstract: Block-matching algorithm (BMA) is always the focus of video coding techniques because of its simplicity and efficiency. In the past decades, many fast BMAs are proposed to realize the goal of coding video in time. Among them, the fastest one is the OTA (one at a time algorithm), which is very simple, fast and effective with very little additional computation expending. But, at the same time, it also has some problems including easy trapping into local minima and bad compression performances. In this paper, several novel search strategies used in the proposed OTA are proposed; actually, all these search strategies can be used in other algorithms. These search strategies include new adaptive termination threshold, motion vector (MV) prediction, zero MV priority and search templates. Extensive standard test sequences have shown that the proposed search strategies and algorithm is very effective, robust and adaptive. We focus on all the performances of coding image but not only on bit-rate or PSNR.