# A Lot Of Rooks!

Dimitri places the maximum possible number of Rooks on a $$8\times 8$$ chessboard in such a way that there's no two Rooks that attack each other. In how many ways can he do that?

×