It combines two of my all-time favourite constraints: Entropic Lines and Killer cages. I am thanking Calvinball and NEWS for testing and wish you joyful solving!
Rules:
- Normal sudoku rules apply, i.e. each row, column, and 3x3 region has to contain the digits from 1 to 9 once each.
- Entropic Lines: Any three adjacent digits along a peach line must contain one low digit (1, 2, or 3), one medium digit (4, 5, or 6) and one high digit (7, 8, or 9).
- Killer cages: Digits in a cage must sum to the clue in the top left.
Here you can solve the puzzle online:
Shaded version: Solve on Sudokupad
Unshaded version: Solve on Sudokupad
Solution code: Row 5 from left to right (9 digits in total)
on 3. November 2025, 00:10 by Lenivaya_Joppa
Thank you for this very nice puzzle, dear sujoyku! I really enjoyed solving it! :)
**
Thank you, Lenivaya_Joppa! It is great to know that you enjoyed it.
Kind regards, sujoyku
on 25. October 2025, 21:58 by Densii2048
it was fun until i started on the middle row of boxes and got really confused and had to guess a cell to finish. Really good nonetheless!
**
Thank you for your comment, Densii2048! I am glad you enjoyed it. There is no guessing required. If you like to know about the intended step at that point, let me know.
Kind regards, sujoyku
on 19. October 2025, 03:00 by JigzSter
Nice puzzle!
**
Thank you, JigzSter!
Kind regards, sujoyku
on 18. October 2025, 23:54 by sujoyku
Thank you for all you kind comments, @Zibl, @Wuschel, @Chaka, @googuee and @MSDOS! I am glad that you enjoyed the puzzle.
Kind regards, sujoyku
on 18. October 2025, 23:16 by MSDOS
Nice and smooth, lovely logic, thanks for setting!
on 18. October 2025, 21:05 by googuee
Very nice and approachable puzzle!
on 18. October 2025, 14:52 by Chaka
If a 1* sudoku is still able to be so magnificent it's probably the work of Sujoyku. Thank you for another beautiful puzzle! <3
on 18. October 2025, 12:27 by Wuschel
Very nice. Thanks!
on 18. October 2025, 10:44 by Zibl
Lovely puzzle as always, sujoyku! Thank you! :)
| Difficulty: | ![]() |
| Rating: | 97 % |
| Solved: | 229 times |
| Observed: | 0 times |
| ID: | 000PR5 |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.