  PPSZ is the fastest known algorithm for (d,k)-CSP problems, for most values
of d and k. It goes through the variables in random order and sets each
variable randomly to one of the d colors, excluding those colors that can be
ruled out by looking at few constraints at a time. We propose and analyze a
modification of PPSZ: whenever all but 2 colors can be ruled out for some
variable, immediately set that variable randomly to one of the remaining
colors. We show that our new "impatient PPSZ" outperforms PPSZ exponentially
for all k and all d >= 3 on formulas with a unique satisfying assignment.
