Noodles
(Published on 10. May 2024, 22:08 by Paletron)
- Every row, column and region contains digits 1-9. Regions are to be determined by the solver. Every region is a snake, a one cell wide path of 9 orthogonally connected cells that does not branch or contain a 2x2 block of cells.
- One end of each snake is its head. Circled digits show the distance along the snake to the head (1 being at the end of the region). All circles are given.
Solution code: Row 5
Comments
on 21. August 2024, 20:12 by AsgarArn
Finally after a bit over 4 hours i manage to find the solution.
It took its time but well worth it. Some breaks in between to come back with Fresh eyes.
Super Nice and well constructed.
on 15. May 2024, 11:54 by jinkela114514
I forgot the negative constraint in the sudoku part for a while, which might be the reason why many this puzzle is rated 5* difficulty. (But I rated it 4* difficulty according to my time spent on the puzzle)
on 12. May 2024, 23:16 by SenatorGronk
Another entry in the pantheon of “surely there’s not information for a unique solution” puzzles. The early deductions were very tough and very satisfying as more of the puzzle’s internal logic was revealed. Great job!
on 12. May 2024, 17:55 by sanabas
amazing puzzle
on 12. May 2024, 10:59 by Christounet
Superb CC puzzle ! Enjoyed building these little snakes. Thanks :)
on 11. May 2024, 11:02 by marcmees
Very nice. closing the last 3 regions was a bit tricky. Thanks
on 11. May 2024, 08:50 by Jesper
Great puzzle, thanks!
on 10. May 2024, 22:34 by MicroStudy
awesome puzzle!!
