## On the Subject of Generated Maze

I’m not sure this is (an) ideal...

This module consists of a 5×5 maze with 40 toggleable interior walls, four direction buttons, a submit button and a colored player shape.

To solve the module the defuser must reconstruct the maze and move to the goal square. Moving into a wall, attempting to move off the maze or submitting an incorrect configuration will cause a strike.

For each internal wall, calculate its value by adding the values of the adjacent squares, whose value is found by adding the column variable to the row number, with A1 being top left.

The goal row is congruent to the number of filled walls in the final maze modulo 5, plus one. The goal column is congruent to the number of totally isolated cells (cells which have zero legal moves) modulo 5, plus one (with A being column 1, B being column 2, and so on).

#### Column Variables

A | B | C | D | E | ||||
---|---|---|---|---|---|---|---|---|

No. of batteries | 1 | 2 | 3 | No. of port plates | 1 | 2 | 3 | No. of indicators |

G | B | R | ● | + | ■ |

If the wall's value is congruent to 0, modulo 3 it should not be filled in.