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 a round wall-spot on the corner of a cell. 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. ONE-WAY DOORS: Finkz 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 values it sits between. TEST CONSTRAINT: In this experiment, for any two adjacent digits along the correct path, one can be divided by the other to give an exact integer (ie; one is a multiple of the other.)