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 gives the singleton constraint domain . 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.

Ancestors (8)

  1. N-queens problem
  2. Constraint satisfaction problem
  3. Search problem
  4. Computational problem
  5. Computational complexity theory
  6. Theoretical computer science
  7. Computer science
  8. Home

Incoming links (4)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version