thank you very much jkr
I requested n Queen problem using local search and CSP. but your links are not
no problem, thanks anyway...
Main Topics
Browse All TopicsHello
I'm looking for a source code for N Queen search problem using local search and using CSP.
waiting for your useful links. It's not important it's language but better in C/C++
thanks
This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.

Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
Hi CSecurity,
It seems that the term CSP has a couple of meanings here. The "CSecurity Poser" and what you probably intended, "Constraint Satisfaction Problem". (Sorry -- too much cold medicine, I guess.....)
It would seem that all of the "local search" requirements are met if the variables used in the algorithm are encapsulated into a single structure.
typedef struct
(
int Board[100]; // limit the board to 100x100
int Dimension; // Number of rows/columns in the board. Assumes a square structure.
int Index; // The relative column currently being checked.
int Column; // The absolute column currently being checked.
int CheckIndex; //
int Increment; // Bias to the next column. (Relatively prime to the board size)
int Status; // Return code, where appropriate.
);
The Index variable is simply the count (0 to N-1) of the column being checked. Depending on the strictness of the term "local variable" you may not be able to use recursion. If not, simply use the Index variable to control the column being tested, and the CheckIndex variable as the index of the column being tested against.
Kent
Business Accounts
Answer for Membership
by: jkrPosted on 2009-10-30 at 11:52:10ID: 25705816
Take a look at the following site:
com/Beginn ers_Lab_As signments/ code29.htm l demo/nquee ns.html
http://www.c.happycodings.
http://jsomers.com/nqueen_