On a chessboard (an \(8 \times 8\) grid), we place eight identical rooks. A rook can move any number of squares in a straight line horizontally (along a row) or vertically (along a column). In chess, a piece can take another piece if it can move to the other piece’s square in a single move.
In how many ways can we arrange the eight rooks so that no rook can take any other?