Combinatorics and Graph Theory · Problem 1.2.6

Fundamentals — David Guichard

Mathematics — Combinatorics · non-attacking-rooks

Problem

Suppose that we want to place 8 non-attacking rooks on a chessboard. In how many ways can we do this if the 16 most `northwest' squares must be empty? How about if only the 4 most `northwest' squares must be empty?

Browse the problem library