In this experiment, nine letters of the alphabet (to be determined) must be used to fill the grid so that no letter repeats in any row, column or 3x3 box. 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. DYNAMIC FOG: Entering correct letters may clear fog somewhere in the maze. No guessing is necessary. CUE CARDS: Each pink cue card sits between two letters that both appear on that cue card. BRAINWAVE MONITORS: The faint light of 11 blue monitors are visible through the fog; Finkz must visit all of these before reaching the cupcake. With any luck, they will provide an insight into her thoughts. TEST CONSTRAINT: 3x3 box borders divide Finkz' path into segments. If a segment contains more than one cell, then the cells must be visited in alphabetical order.