I've been told that this thread should have been in this section. https://www.physicsforums.com/showthread.php?t=101782" Sorry about that. EDIT: HERE IS THE TEXT This is mind boggling. There is an array of 16 squares, arranged in a 4 x 4 grid. A supply of 4 A's, B's, C's, and D's are given. How many distinguishable ways are there of placing each of the letters in a square, if, one letter must appear once in each row and each column? I'm lost. There are 4! ways of placing the letters in the first row. But then when you get to the second row, you can place the A, which has 3 possible locations. But then the B, depends on where the A was placed. If the A was placed under the B in row 1, then you have 3 possible spots left, but if the A was placed under the C, then there are only 2 spots left. Shown below. The letters represent their placement, the 0 represents a spot that a B can't be placed, and a - represents a spot the B CAN be placed. R1: ABCD R2: -A-- or R1: ABCD R2: -0A- See the problem? How do I get around this????