Combinatorics and Graph Theory · Problem 1.2.5

Fundamentals — David Guichard

Mathematics — Combinatorics · non-attacking-rooks

Problem

In chess, a rook attacks any piece in the same row or column as the rook, provided no other piece is between them. In how many ways can eight indistinguishable rooks be placed on a chess board so that no two attack each other? What about eight indistinguishable rooks on a 10×1010 \times 10 board?

Browse the problem library