On the Subject of Cruel Dividable By 2
It’s back!... And yet it still doesn’t know that it’s “divisible”, not “dividable”, in this context...
This module contains a display flashing a sequence of digits (with a break between the start/end of the sequence; the sequence can be restarted by pressing the display), and two buttons: a green one labeled “Y”, and a red one labeled “N”.
The flashing sequence of digits gives you information about some digits, which were placed into the maze below, and which then moved around it.
| 0 | 1 | 2 | 3 | 4 | |
|---|---|---|---|---|---|
| 0 | |||||
| 1 | |||||
| 2 | |||||
| 3 | |||||
| 4 |
- The first two digits of the sequence, concatenated into a two-digit number, give the value of N (10-14) - the number of digits that were placed into the maze.
-
The next N * 3 digits, split into N groups of 3 - digits D, R, and C in each group, respectively,
give information about each digit’s value and starting position in the maze:
- D is the value of the digit (0-9).
- R is the starting row of the digit (0-4).
- C is the starting column of the digit (0-4).