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? *This question is included in Nova Math - Problem Set K: Elimination Strategies, question #6