Can a knight travel across a chess board touching each square once, if opposite corners are cut off?
Logic
Level
2
Assuming the two highlighted squares were not part of the chess board, is it possible in anyway to land on every square on the board, without landing on a square multiple times (using a knight move of course).
Yes
Depends what color square you start on
It is impossible
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
When you move a knight, you move from the color square you are on to the opposite color square. In this example, we have 30 white squares and 32 green (?) squares. No matter what, once we have touched all 30 white squares, we will have at least 2 green squares left, which means we must touch at least 1 white square to reach our destination, but we have already landed on all the white squares, hence, it is impossible.