Somewhat Optimizing Dividing By 2 Cruely

“Divisible”, not “dividable.” You still can not divide this mess in half.

Original Manual

	0	1	2	3	4
0
1
2
3
4

From the entire sequence of digits:

• N = first two digits displayed (10 - 14)
• Next (3 × N) digits form triplets in the form, DRC:
  • D = (0 - 9)
  • R = starting row of that digit (0 - 4)
  • C = starting column of that digit (0 - 4)
• Digits afterwards are converted into moves, 0 representing Up and going clockwise:

  0	1	2	3
  Up	Right	Down	Left

Then for each digit in the maze...

• Move that digit in the maze one space in that received direction. If a move would cause a digit to go through a wall, rotate the current direction for that move clockwise until it does not.
• Every row in the maze should have at least one digit in it.

For each row, top to bottom, in order 0 - 4:

• “Y” if the sum of digits in the current row is between 12 - 43 inclusive, “N” otherwise.
• Use the left table for each digit in that row and convert them into their new values based on the current column they are in, using the current digit as the row.
• Sum these new values, and modulo the result by 15. Press the button with that label when the total time in seconds is that value, modulo 15. Use the original manual if necessary for the time stamps.

	0	1	2	3	4
0	1	0	0	0	0
1	1	1	2	3	4
2	1	2	4	8	1
3	1	3	9	12	6
4	1	4	1	4	1
5	1	5	10	5	10
6	1	6	6	6	6
7	1	7	4	13	1
8	1	8	4	2	1
9	1	9	6	9	6