Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (mendicant_bias):

OLYMPIAD CHALLENGE 2/320: "In chess, is it possible for the knight to go (by allowable moves) from the lower left-hand corner of the board to the upper right-hand corner and in the process to light exactly once on each square?"

OpenStudy (mendicant_bias):

Let's see, what are the dimensions in squares of a chess board, anyways?

OpenStudy (jtvatsim):

8x8

OpenStudy (jtvatsim):

Are the corner colors the same?

OpenStudy (jtvatsim):

That is going to be a problem I think...

OpenStudy (jtvatsim):

Lower-left is black, upper-right is black, and I believe the Knight switches colors each move.

OpenStudy (jtvatsim):

There needs to be an odd number of color switches between the first and last move. But there are 62 squares between the two corners we care about! It cannot be done!

OpenStudy (mendicant_bias):

Corner colors are the same in a diagonal, e.g. one diagonal of the board has white corner pieces at the ends, one has black. |dw:1418698015729:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!