The Conflict directed Backjumping (CBJ) algorithm attempts to reduce the number of nodes visited within the constraint satisfaction problem by analyzing failures. The Nogood Recording (NR*) algorihms incorporate, during the search, part of the results of these analyzes as constraints in the CSP solved itself. In both cases, failures are the basic information used to increase efficiency. It is shown how artificially augmenting the number of failures may lead to notable improvements in efficiency.