In this paper, we present a general algorithm which gives an uniform view of several state-of-the-art systematic back-tracking search algorithms for solving both binary and non-binary CSP instances. More precisely, this algorithm integrates the most usual or/and sophisticated look-back and look-ahead schemes. By means of this algorithm, our purpose is then to study the interest of backjump-based techniques with respect to conflict-directed variable ordering heuristics.