On an chessboard, 6 black rooks and white rooks are placed on different cells so that each rook only attacks rooks of the opposite color. Compute the maximum possible value of .
Solution
The answer is . For a valid construction, place the black rooks on cells for and the white rooks on cells and for . Now, we prove the optimality. As rooks can only attack opposite color rooks, the color of rooks in each row is alternating. The difference between the number of black and white rooks is thus at most the number of rooks. Thus, .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.