Results 1 to 2 of 2
Thread: The N Queens Problem
LinkBack URL
About LinkBacks- 03-19-2012, 07:46 AM #1
Member
- Join Date
- Mar 2012
- Posts
- 1
- Rep Power
- 0
The N Queens Problem
I need to apply Domain-independent uniform cost state-space searching techniques using Java to the N-Queens Problem. The N Queens problem is to place N Queens on a chess board in such a way that no Queen can move to a square occupied by another Queen.
The problem is to find a way in which to place N Queens on an N-by-N board, where N is >=4 and <=8. I need to Experiment with both breadth-first and depth-first techniques.
I really could use some help with this, as I really do not know from where to begin?
- 03-19-2012, 08:45 AM #2
Moderator
- Join Date
- Sep 2008
- Location
- Voorschoten, the Netherlands
- Posts
- 11,375
- Blog Entries
- 7
- Rep Power
- 17
Re: The N Queens Problem
I removed you other identical thread; w.r.t. your question: Google is your friend here as well as the terms 'back tracking', 'brute force' and 'recursion'.
kind regards,
JosWhen people rob a bank they get a penalty; when banks rob people they get a bonus.
Reply With QuoteSimilar Threads
-
Eight Queens Problem
By Jtrtoday in forum New To JavaReplies: 6Last Post: 01-28-2012, 11:53 PM -
How to solve the Eight Queens puzzle without recursion?
By kiregad in forum New To JavaReplies: 2Last Post: 03-27-2010, 03:30 AM -
Need help with the Eight Queens game
By kiregad in forum New To JavaReplies: 11Last Post: 03-26-2010, 06:50 PM -
Pruning?? (N-Queens problem)
By n00neimp0rtant in forum New To JavaReplies: 1Last Post: 02-14-2010, 06:41 AM
Bookmarks