Three Threes
(Published on 11. February 2024, 10:13 by IAlreadyHaveAKey)
Normal sudoku rules apply
Construct a one cell wide snake through the grid which travels orthogonally between cells and visits each box exactly once. The ends of the snake are marked by grey squares. The snake may not touch itself, not even diagonally.
Digits in a white circle indicate the number of cells in the up to 9 cells surrounding the circle (and including it) which belong to the snake. Note that the circle may or may not be on the snake.
In each box of the grid, the snake acts as an orthogonally maximal renban line: that is, within a given box, digits on the snake must form a set of consecutive digits, and cells orthogonal to the snake (within that box) cannot be consecutive with any digit on the snake (within that box).
Digits separated by a white dot are consecutive, and digits separated by an X must sum to 10.
Solution code: Row 3 followed by Row 9
Comments
on 13. February 2024, 00:55 by IAlreadyHaveAKey
changed difficulty
on 13. February 2024, 00:55 by IAlreadyHaveAKey
thanks @yttrio! Yeah I wasn't sure about the difficulty, I'll update it.
on 12. February 2024, 20:46 by yttrio
Very cool puzzle! Probably harder than 3 stars IMO, but it was really fun figuring out how the orthogonally maximum Renbans needed to work.
on 12. February 2024, 09:46 by IAlreadyHaveAKey
rule clarification
