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?