Define a *Galloping Queen* as a chess piece whose legal move is that of a Knight, and that of a Queen.

What is the minimum value of integer \(n > 1\) such that you can place \(n\) non-attacking Galloping Queens on an \(n \times n\) chessboard?

×

Problem Loading...

Note Loading...

Set Loading...