Rules:
Regular sudoku rules:
Place the digits 1-9 in every row, column, and box
Renban Lines:
Digits placed on the magenta Renban Line must be a set of consecutive, non-repeating digits, in any order.
Region Sum Lines:
Box borders divide each blue line into segments with the same sum.
Anti-Knight:
Digits a knights move from each other can not be identical.
Kropki Dots
Black Kropki Dots separate digits that have a ratio of 2:1. Not all dots are given.
Lösungscode: Column 1, read top to bottom
am 17. November 2025, 14:48 Uhr von Djirt
Спасибо, великолепная конструкция!
am 16. November 2025, 13:48 Uhr von daanhillside
That was brilliant. And 3/5 stars for difficulty so far is insane. At least 4/5 would be better.
Merdock: Thank you for the compliment. I am quite terrible at ranking the difficulty of my puzzles, I am curious what you would set it as.
am 25. Oktober 2025, 00:29 Uhr von VitP
first to solve ?
Merdock: I'm not entirely sure. While normally I submit these puzzles with a single solve counter (my own), this one did not. After I created and tested the puzzle, I changed the name and this reset the solve counter. The solve counter is currently at 2, so your either the first or second. Regardless, thank you for solving the puzzle! I appreciate every one that attempts it.
am 25. Oktober 2025, 00:00 Uhr von SennyK
Editing my comment is good approach as I get email informing of it. Thank you for amending the ruleset
am 24. Oktober 2025, 23:41 Uhr von Merdock
Corrected rule description
am 24. Oktober 2025, 23:34 Uhr von SennyK
Hey, I wanted to solve your puzzle, but this rule is unclear to me:
Both Diagonal blue lines are considered to be parts of the same line.
Merdock: My most sincere apologies. As I do this on my phone, I often find it easier copying and pasting descriptions, and doing it this time I forgot I was pulling from a puzzle where I felt I needed a little clarification on that particular. I have updated the puzzle. Again, I'm sorry for the confusion.
I'm not sure what's the best way to respond to comments, if there is a better method please let me know.
| Schwierigkeit: | ![]() |
| Bewertung: | 88 % |
| Gelöst: | 23 mal |
| Beobachtet: | 0 mal |
| ID: | 000PU7 |