0
$\begingroup$

I am studying CSP for my master thesis. I found that many thesis based on CSP described N-Queens as an introductory and they actually do experiment on random CSP problems.

If so,when I do master thesis in CSP,it is reasonable to experiment algorithms with N-Queens.

How can N-Queens problem be changed CSP parameters like Tightness,Constraint Density to experiment?

I wonder why many researchers test their CSP algorithms with Zebra problem, sudoku ,random CSP but why not N-Queens problem? Is N-Queens problem with CSP does not give better results?

$\endgroup$
1
$\begingroup$

n-queens problem can be solved quite efficiently with a very simple algorithm (finding all solutions takes ages, because the number grows exponentially).

Getting anywhere near that efficiency with a general method is impossible.

$\endgroup$
1
  • $\begingroup$ What do you exactly means getting anywhere ? $\endgroup$ – Cecelia Feb 18 '20 at 4:05

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.