Backtracking tactics in the backtrack method for SAT

Backtrack is an exhaustive search method by consecutively extending partial solutions. Backtracking is a step of backtrack, which occurs when extensions cannot go deeper. So far, people have taken the depth-first backtracking tactic as default in backtrack methods. This paper discusses backtracking tactics for the SAT problem. We propose a category of new backtracking tactics that are better than the depth-first backtracking tactic in our computational experiments.