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.

Two players, three pots | Rating: 3.00
Posted on 2020-01-03 by Brian Smith (Solution Posted, 4 Comments)

Sudoku 1 (starting clues) | Rating: 1.00
Posted on 2018-11-30 by Ady TZIDON (No Solution Yet, 7 Comments)

White to move |
Posted on 2018-07-20 by Ady TZIDON (No Solution Yet, 6 Comments)

Dice stacking |
Posted on 2017-11-28 by TheKPAXian (No Solution Yet, 4 Comments)

31 or more |
Posted on 2017-10-21 by Ady TZIDON (No Solution Yet, 5 Comments)

2 kids 3 boxes | Rating: 4.00
Posted on 2017-07-01 by Ady TZIDON (No Solution Yet, 1 Comments)

First or second? | Rating: 3.00
Posted on 2017-05-23 by Ady TZIDON (Solution Posted, 6 Comments)