-
January 30th, 2006, 08:10 PM
#1
N Queens problem
Does anyone have the pseudocode or code for this N queens problem
Place N queens on an N x N chessboard in such a way than none of them are able to capture the others. Write a function, combinations(N), which would return the number of possible combinations for any integer N. Assume N is between 4 and 12.
-
January 31st, 2006, 01:00 AM
#2
Re: N Queens problem
Why don't you give it a shot and let us know what problems you run into?
I don't think anyone here is going to do your homework for you.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|