Let's say we have chess table $n^2$ and we want to put 8 rooks on the table, so that none of them are under eachother's fire.
I've come up with this: $$n^2 + n^2(n-1)+n^2(n-1)(n-2) ...$$ I think that I'm not taking into account that the pieces are indifferentiable. That means I should substract number of permutations, but how many? and is the first equation even correct?