RAT RUN 15: Connectedness

Normal sudoku rules apply.

AIM OF EXPERIMENT: Finkz the rat must reach the cupcake 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, Finkz may move diagonally if there's a 2x2 space in which to do so, but may never pass diagonally through the rounded end / corner of a wall.

BLACKCURRANTS: Cells connected by a blackcurrant have a 1:2 ratio (one is double the other.) Not all possible blackcurrants have been given.

TELEPORTS: Entering a teleport will cause Finkz to be instantly transported to the matching coloured teleport. From there she can continue her journey. Matching teleports always have identical digits, but teleports that don't match always have different digits.

TEST CONSTRAINT: Finkz' path is formed of one or more segments. Any uses of teleports will divide Finkz' path up into physically separate segments, ie; if a teleport is used, the current path segment ends at the entry teleport, and a new separate path segment begins at the matching exit teleport. Any path segment must function as a renban; it must consist entirely of a set of non-repeating, consecutive digits, which can be arranged in any order along the path segment.