As backtracking search explores paths in its search tree it makes various inferences about the problem. The inferences search
computes can be very computationally expensive to compute statically. However, in most backtracking CSP solvers this information
is discarded when the search backtracks along the current path.