Question 2
An $8\times8$ chessboard is colored, one color per square. Any two diagonally adjacent squares, or any two squares a knight move apart, have different colors. What is the minimum number of colors? The Vietnamese source includes the following illustration of knight moves.
