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).

×

Problem Loading...

Note Loading...

Set Loading...