Imagine there are infinite number of Queens (Chess Game Piece) with u. Find the minimum number of queens required so that every square grid on the chess board is under the attack of a queen. Arrange this minimum no. of Queens on a chess board.

See the following chess case and it’s White's turn to move. If both White and Black play optimally, what is the minimum number of moves for White to checkmate the Black king?