Generating chess pieces

On a standard 8x8 chess board, I'm trying to generate all the possible placement of 8 pieces so that no two pieces are on the same row or same column. Diagonals are ok, just rows and columns.

I know it's possible to do it randomly, but I can't think of an algorithm to generate every combination systematically. Right now I'm thinking along the lines of something like:

int[] piece =newint [7];

I let the index value of piece to be the row number, and let the actual value of piece to be the column number. Any help on this would be greatly appreciated.

[683 byte] By [P@PE.SOWa] at [2007-10-2 17:44:46]