Question

In the game of chess, the Knight can make any of the moves displayed in the diagram to the right. If a Knight is the only piece on the board, what is the greatest number of spaces from which not all $8$ moves are possible ?

• A. $8$
• B. $24$
• C. $38$
• D. $48$

Answer 1

The correct option is A $8$

$\begin{array}{c}\text{Solution - we know that the knight requires three}\\ \text{spaces on all its sides to move. Hence}\\ \text{counting the the verticle columns on both}\\ \text{the sides gives us}16\times 2=32\end{array}$

Counting the leftover top and bottom spaces

$\Rightarrow 8\times 2=16$

Adding both gives us

$\Rightarrow 32+16=48$

Hence (D) is the correct option.