- ...problems
- The class of CSP problems is NP complete.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...queens
- Solutions for n queens can be generated by a
deterministic algorithm, however this problem is useful for providing
a simple and
illuminating example of techniques which also pay off where there are
no such alternative algorithms!
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...store
- Strictly all variables in
the clause are renamed, but we omit this detail for simplicity.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.