
The N Queens Problem
I need to apply Domainindependent uniform cost statespace searching techniques using Java to the NQueens 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 NbyN board, where N is >=4 and <=8. I need to Experiment with both breadthfirst and depthfirst techniques.
I really could use some help with this, as I really do not know from where to begin?

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