# Math and chess question!

Given a $6\times6$ chess board with $13$ marked squares, can you always place three mutually non-attacking rooks on the marked squares? If so, how can this be proven?

-
You mean to say that there are three rooks which will never attack each other? –  Sawarnik Feb 22 at 5:26
Yes. Maybe at the end –  user130644 Feb 22 at 5:30
I think it should just say three pieces that occupy three different rows and three different columns. According to the rules of chess, two rooks even if on the same row or column (rank and file?) do not attack each other if there is a piece between, but this exception is not intended. (Also one usually glosses over the fact that rooks that attack each other have to be of opposite colours; if of the same colour they would instead defend each other.) –  Marc van Leeuwen Feb 22 at 7:47
If you randomly put 13 rooks on a 6x6 chess board prove that 3 of them will never attack each other". –  user130644 Feb 22 at 16:24

The squares of the board can be divided into six subsets, each one consisting of a NE-SW diagonal that wraps around the board if necessary. Mathematically, the $j$th subset ($0\le j\le5$) consists of those squares in the $r$th row and $c$th column such that $r-c\equiv j\pmod 6$. These subsets are pictured below.