dwfc wfc on dwave Describe wfc as a CSP, translate the constraints to a BQM, give to kerberos solver. constraints: each cell in the output must contain one digit each NxN pattern in the output must exist in the input the output must not match the input