In: Statistics and Probability
One
rook is placed in some unit squares of a 100 × 100 chessboard.
Castles in...
One
rook is placed in some unit squares of a 100 × 100 chessboard.
Castles in the same row or in the same column, with no other
castles threaten each other. Regardless of the number and location
of the castles, if any two castles that threaten each other can be
in different colors, what is the smallest value of the number n
that can always be painted in one of n colors?