Normal sudoku rules apply.
In the grid, construct a non-intersecting loop of orthogonally or diagonally connected cells which:
1) Contains two or three cells in every box;
2) Is symmetric about the negative diagonal, but contains no cells on that diagonal;
3) Never contains the value N in box N; and
4) If it contains a segment in box N, the values on that segment must differ by N.
Global constraints:
1) Digits may not repeat on the positive and the negative diagonal; and
2) Digits separated by a king's move in chess cannot be the same.
3) Digits separated by a V sum to 5.
4) Digits separated by an X sum to 10.
5) All V's and X's in the grid are given.
Solution code: Enter column 2 of the grid in order from top to bottom.
on 24. December 2025, 07:24 by QuiltyAsCharged
Very cool puzzle, these rules lead to interesting and unusual logic. It's surprising to see how the loop emerges!
The hardest part for me wasn't the loop drawing itself, but narrowing down certain options in the mid-solve
on 19. April 2025, 13:28 by Briks
I saw the break in at once. Though not easy. Enjoyed it a lot!
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.