In a constraint satisfaction problem (CSP), we are given a set of $n$ variables subject to $m$ constraints. The computational question is to decide whether there exists a variable assignment satisfying all constraints. Motivated by interest in the "typical" behavior of computationally hard problems, there has been extensive research in models of randomized CSPs. In many such models, experimental...