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?

×

Problem Loading...

Note Loading...

Set Loading...