Question 81
Let $k$ be a positive integer. Determine the largest number of snakes, consisting of four squares (see figure), which can be placed on a $(2k+1) \times (2k+1)$ chessboard so that the snakes neither overlap nor stick out across the edges of the chessboard. The snakes can be turned and reflected.
