What strategies one can use to keep maximum number of non attacking pieces on an $n \times n$ chess board? [closed]

What are the strategies one can use to keep maximum number of non attacking pieces (all pieces other than pawn) on an $n\times n$ board? It is like an $n$-queen problem but here instead of only queen other pieces also come into picture. Like if I have a knight, queen, king, bishop, knight what are the best strategies to keep them on a $n\times n$ board such that non of the pieces attack each other?

Just to add to it, I will be getting pieces one after another in a random manner, so basically I don't have any control over the sequence and count of pieces that come along. Like 1. Queen 2. Bishop 3. Queen 4. Knight and I have to keep them on an $n\times n$ board such that no pieces attack each other.

• Are all the pieces independed, i.e. can any piece attack any other piece or are there black and white pieces? And I am assuming you mean no attacks in a single move? – Godric Seer Jun 7 '13 at 15:47
• all the pieces are independent , so no difference in black or white. It is very similar to arranging N queens on an N X N chess board. Just that here instead of queens there are other pieces also ( other than pawn ) – user1387 Jun 7 '13 at 15:50
• I rolled back to question text, since the recent edit removed all hints as to what you were asking. – Godric Seer Aug 25 '13 at 17:02