Results 1 to 2 of 2
  1. #1
    IAmDan is offline Member
    Join Date
    Mar 2012
    Rep Power

    Default 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?

  2. #2
    JosAH's Avatar
    JosAH is offline Moderator
    Join Date
    Sep 2008
    Voorschoten, the Netherlands
    Blog Entries
    Rep Power

    Default 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,

    Build a wall around Donald Trump; I'll pay for it.

Similar Threads

  1. Eight Queens Problem
    By Jtrtoday in forum New To Java
    Replies: 6
    Last Post: 01-29-2012, 12:53 AM
  2. Replies: 2
    Last Post: 03-27-2010, 04:30 AM
  3. Need help with the Eight Queens game
    By kiregad in forum New To Java
    Replies: 11
    Last Post: 03-26-2010, 07:50 PM
  4. Pruning?? (N-Queens problem)
    By n00neimp0rtant in forum New To Java
    Replies: 1
    Last Post: 02-14-2010, 07:41 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts