Imagine a 10x10 chessboard with a fictitious King who can move in three possible directions: up, left and diagonally down-right,
- one step to adjacent square only.
Your task is to devise a route starting at a square of your choice and returning to the same square including in your itinerary each square of the board exacty once.

Present your solution or prove that it can't be done.

It is not divisible, so I think there's no solution.

Posted by Josephine on 2022-07-12 03:51:12