Chess detached
Logic
Level
2
Two opposite corner squares are detached from the chessboard.
Is it possible to make a path for a knight such that it visited all of the square once and only once? If yes, how many ways are there?
Yes, 4 ways
Yes, 16 ways
Yes, 1 way
No
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
Each move alters between black and white squares. But the new chessboard has 2 less squares of one kind than the other, so a knight tour is impossible.