Forgot Password?
 
Links
About Arcadia LSAT Shorthand NotationArcadia Prep's GMAT CourseArcadia Prep's LSAT CourseArcadia Prep's SAT CourseArcadia Prep's GRE CourseThe Simply Brilliant GMAT AppAbout the MCATMCAT Physical and Biological SciencesAbout Arcadia Prep's MCAT CourseTerms of SaleTerms of UseAbout Arcadia Apps
iPhone App Store
GGRE Prep App
GMAT Prep App
LSAT Prep App
LSAT Prep
SAT Prep App
 
Back to Questions

In the game of chess, the Knight can make any of the moves displayed in ... ...

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) ...
(C) ...
(D) ...
(E) ...

*This question is included in Nova Math - Problem Set M: Elimination Strategies

Collapse All Subordinate Threads
Image Not Available
 
Replies to This Thread: 0 | ----
In the game of chess, the Knight can make any of the moves displayed in ... ... 
Posted: 01/03/2015 09:53
What does this question mean? I don't understand at all.
Image Not Available
 
Replies to This Thread: 1 | ----
In the game of chess, the Knight can make any of the moves displayed in ... ... 
Posted: 12/12/2015 11:55
same here. Can someone further explain the question asked?
Arcadia
Admin
Reply 1 of 1
Replies to This Thread: 0 | ----
 
Posted: 12/12/2015 12:33
Hi Joelene,

In the attached graphic, the shaded squares represent the areas from which not all 8 moves are possible (there are 48 shaded squares).

Note: Each valid move for the Knight consists of moving through either two horizontal squares and then one vertical square or two vertical squares and then one vertical horizontal square. Doing this from any of the shaded squares would move the Knight off the board.

Nova Press
Arcadia Prep © 2012.
Contact Arcadia  |  Terms of Use  |  Terms of Sale  |  Change Log-in Info