Normal sudoku rules apply. 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. Digits separated by a green grape have a difference of at least 5. In this experiment, dotted box borders divide the correct path into 'index lines'; In any box, the Nth cell visited by Finkz is called 'position N'. (So, for example, in box 7, r9c2 is position 1.) The digit in position N always indicates which position along that segment contains the digit N. Eg: In a box, Finkz might visit the digits 35142 in that order. The first digit being a 3 indicates that the third digit is a 1, the second digit being a 5 indicates that the fifth digit is a 2, and so on.