Normal sudoku rules apply.
AIM OF EXPERIMENT: Finkz and Phinx must both reach different cupcakes by finding a path through the maze. The paths must not visit any cell more than once, cross themselves or each other, share cells, or pass through any thick maze walls.
As well as moving orthogonally, they 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.
BLACKCURRANTS: If a blackcurrant sits between two digits, one is double the other.
REDCURRANTS: If a redcurrant sits between two digits, one is odd and the other is even.
GRAPES: If a grape sits between two digits, they have a difference of at least 5.
VIDEO CAMERAS: The digit on a grey camera indicates the total SUM of the digits in any visited cells that the camera's lens points towards (before a wall is reached, which blocks vision.) A video camera cell itself may not be entered.
TEST CONSTRAINT: In this experiment, all of the low digits in the grid (1s, 2s and 3s) must be visited, but none of the high digits (7s, 8s, and 9s) may be visited. The two rats' paths must be perfect reflections of each other across the positive diagonal (marked with a thin pink line).
Lösungscode: Digits visited by either rat in column 7, reading downwards
Heute, 05:21 Uhr von Samoth
A nice break (relatively speaking, at least) from the past handful of rat runs, a wonderful puzzle all-around as usual!
Heute, 04:53 Uhr von antiknight
Cool puzzle not hard like the earlier ones! It has some interesting steps tho.
Heute, 04:50 Uhr von QuiltyAsCharged
Lovely puzzle. It's a bit of an easier chapter this week, but easy to get off course if you don't carefully consider every possibility!
Heute, 04:43 Uhr von cmusson32
Beautiful puzzle yet again. Classic Marty style with the pathfinding that I have come to really enjoy
Heute, 04:38 Uhr von Angara
It's not so difficult, but it's a very beautiful puzzle. Thank you, Marty! Pray for Elliott
| Schwierigkeit: | ![]() |
| Bewertung: | 96 % |
| Gelöst: | 32 mal |
| Beobachtet: | 1 mal |
| ID: | 000S9M |