= Queens completion problem
Complete a prescribed subset of occupied cells to a solution of the <N-queens problem> while retaining every prescribed queen. In a row-variable <constraint satisfaction problem>, a clue $(r,c)$ gives the singleton <constraint domain> $D_r=\{c\}$. Conflicting clues prove impossibility immediately, but nonattacking clues need not extend to a full solution. <Backtracking> decides the finite problem; <hill climbing> can search large candidate boards without an exhaustive guarantee.
Back to article page
