I am self-studying Discrete Mathematics and I want to solve the following question.
How many ways there are to put eight equal towers on a chessboard such that there are no two equal towers in the same row or in the same column? And if the towers are distinct-looking?
I solved the first part, and the answer is $8!$, but I was not able to solve the second part. It says that the answer is $(8!)^{2}.$ Could you please help me to solve this?