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.

中文翻译：

---

不耐烦 PPSZ——一种更快的 CSP 算法

PPSZ 是已知最快的 (d,k)-CSP 问题算法，适用于大多数 d 和 k 值。它以随机顺序遍历变量，并将每个变量随机设置为 d 种颜色之一，排除那些可以通过一次查看少量约束排除的颜色。我们提出并分析了 PPSZ 的修改：每当可以排除某些变量以外的所有颜色时，立即将该变量随机设置为剩余颜色之一。我们表明，对于具有唯一令人满意的分配的所有 k 和所有 d >= 3，我们的新“不耐烦 PPSZ”以指数方式优于 PPSZ。