Dante's Counting Journey
(Published on 25. December 2023, 16:14 by SenatorGronk)
I had been trying for a while to make a variant of Dante's Journey that added marty sears' Counting Circles constraint, and finally came up with something that works. The two constraints interact in some interesting ways, and I was very happy to find a path that required only a single cage to help disambiguate.
Rules
SudokuPad
Rules
- Standard sudoku rules apply
- There is a path of orthogonally connected cells that visits each of the 9 boxes exactly once, starting at the circle and ending at the square.
- The path CAN touch itself (diagonally and/or by making a 2x2 block)
- Within each box the path cells form a valid thermo, increasing in the direction of the path. Each diamond is on the path and its value equals the number of path cells in its box.
- Within each cage, the sum of the path digits equals the sum of the non-path digits.
- Each digit on the path indicates how many times that digit appears on the path.
SudokuPad
Solution code: Column 5 + Row 5
Solved by tiuhto, Elliptical, tuturitu, misko
Comments
on 28. December 2023, 20:47 by Elliptical
Very Nice
