Schrödingers Rat (A RAT RUN rip-off)
(Published on 26. April 2025, 20:12 by Zanno)
This puzzle is (obviously) inspired by the fantastic
RAT RUN
series by marty_sears. Blame Grimi for stealing the idea—she’s a rat, after
all!
It's also my third experiment with those multi-restricted lines (Part1,
Part2). I'm not sure about the difficulty, but I expect this one to be the
hardest of the three.
Eek, what a night! Grimi the rat barely escaped an undead cat, only to
find herself lost in mad Dr. Schrödinger’s lab. Can you help her find the
exit?
Rules:
- Normal Sudoku rules apply.
-
Standart RAT RUN RULES apply: Grimi the rat must reach the hole
by finding a path through the maze. The path must not visit any cell
more than once, cross itself, or pass through any thick maze walls.
As well as moving orthogonally, Grimi may move diagonally if there's a
2x2 space in which to do so, but may never pass diagonally through a
round wall-spot on the corner of a cell.
Grimi may only pass directly through a purple arrow if moving in
the direction the arrow is pointing.
An arrow always points to the smaller of the two digits it sits between.
-
SCHRÖDINGER LINE EMITTERS: Scattered around the lab are colored
line emitters. The path segment connecting two Emitters (including the
emitter cells themselves) must follow the rules of both emitters (see
below). The emitters at both ends of a segment must have different
colors.
Clarification: The two segments extending from a single emitter are
considered independent lines (For example, a digit may appear on both
sides of a renban emitter without violating its rule). The segments
extending from a region sum emitter may have different sums.
EMITTER RULES:
-
RENBAN (purple): The line contains a set of consecutive digits (not
necessarily in order).
-
NABNER (yellow): No two digits are consecutive, and no digit
repeats.
-
MODULAR (teal): Every set of three consecutive digits must include one
digit from {1,4,7}, one from {2,5,8}, and one from {3,6,9}.
-
ENTROPY (peach): Every set of three consecutive digits must include one
digit from {1,2,3}, one from {4,5,6}, and one from {7,8,9}.
-
REGION SUM (blue): The sum of the digits on the line is the same in
every 3×3 box it passes through. The line has to cross at least one
box-border.
-
TEN SUM (gray): The line can be divided into one or more non-overlapping
segments that each sum to 10.
Solution code: Column 9 top to bottom.
Last changed on on 27. April 2025, 14:28
Solved by OrestisLomis, SKORP17, Piff, monsen, zhugelianglongming, SPring, JustDoggy, 72kchunshuai
Comments
Last changed on 28. April 2025, 17:13on 27. April 2025, 20:56 by monsen
Fun puzzle. It was enjoyable analyzing the possible legal interactions between the lines.
---
Thank you, for your kind words!
on 27. April 2025, 14:28 by Zanno
Fixed a mistake in the Rules.
Last changed on 27. April 2025, 14:27on 27. April 2025, 13:01 by Piff
Is it intentional that those are not standard nabner rules?
---
Argh! No, thats another mistake. Thanks for pointing it Out!
Last changed on 27. April 2025, 14:30on 27. April 2025, 12:13 by OrestisLomis
Very nice interactions between the possible schrödinger lines! Made for quite a difficult solve, but enjoyable nonetheless!
---
Thanks for solving and commenting, glad you enjoyed it!
on 27. April 2025, 00:30 by Zanno
Corrected a mistake in the description