I. Introduction
Automatic test pattern generation (ATPG) belongs in a set of NP-hard problems [1]. Such complexity may force one to try all possible circuit input vectors to find a test for a fault, but this is impractical for large circuits. Popular ATPG algorithms [2], [3] trace backward (i.e., “backtrace”) from an interior node to a primary input (PI) to assign logic values. This action may or may not lead to a test, and in the latter case, the algorithm backtracks, or reverses, the PI assignment. To avoid backtracking, heuristics (i.e., rules based on a designer's intuition) select backtrace directions from available choices.