A $9 \times 9$ chessboard with the standard checkered pattern has white squares at its four corners. What is the least number of rooks that can be placed on this board so that all the white squares are attacked? (A rook also attacks the square it is on, in addition to every other square in the same row or column.)
Problem
Source: Tournament of Towns 2007 - Spring - Senior O-Level - P1
Tags: analytic geometry, combinatorics proposed, combinatorics