## On the Subject of the Quadrant Reflection CM

Going in circles might be a good idea for this one.

For each pair of numbered-lettered screens (1-A, 2-B, 3-C, 4-D), create a key using the keyword on the numbered screen and a true boolean value if the lettered screen contains a 1, and a false boolean value if it contains a 0. Discard any and all letters present on the corresponding lettered screen. This will result in four keystrings, labeled A, B, C, and D according to the number-letter screen pair used.

Fill each keystring into a 5×5 grid, and arrange those grids in the following formation:

 A B D C

If the Submit Button is white, follow the instructions under Encrypt Instructions. Otherwise follow the instructions under Decrypt Instructions.

#### Encrypt Instructions

The current grid will start at the grid corresponding to the lettered screen containing an asterisk.

For each letter,

• Find the letter in the current grid. If it is not present, skip the step below, but still modify the current grid.
• Mirror its position over the axis separating the current grid and the orthogonally adjacent grid with an earlier label in the alphabet. If the current grid is A, use the new position in grid D.
• This is the decrypted letter. The current grid for the next letter will be new grid for this letter.

#### Decrypt Instructions

The current grid will start at the adjacent grid with an earlier label in the alphabet from the grid corresponding to the lettered screen containing an asterisk.

For each letter,

• If the current letter is not present in the previous current grid, skip the step below, but still modify the current grid. Otherwise, find it in the current grid.
• Mirror its position over the axis separating the current grid and the adjacent grid with a later label in the alphabet. If the current grid is D, use the new position in grid A.
• This is the decrypted letter. The current grid for the next letter will be the unused adjacent grid for this letter.

### Example — Using Decrypt Instructions

Encrypted word: RJVH

Screen pairs:

`1 - A: GLAZED - 0V*2 - B: ZEBRA - 1T3 - C: PRODUCE - 1Q4 - D: TINSEL - 1V`

Creating keystrings:

`Keystring A: Keyword last, Remove V: BCFHIJKMNOPQRSTUWXYGLAZEDKeystring B: Keyword first, Remove T: ZEBRACDFGHIJKLMNOPQSUVWXYKeystring C: Keyword first, Remove Q: PRODUCEABFGHIJKLMNSTVWXYZKeystring D: Keyword first, Remove V: TINSELABCDFGHJKMOPQRUWXYZ`

Arranging Keystrings into keysquares

 B C F H I | Z E B R A J K M N O | C D F G H P Q R S T | I J K L M U W X Y G | N O P Q S L A Z E D | U V W X Y - - - - - - - - - - T I N S E | P R O D U L A B C D | C E A B F F G H J K | G H I J K M O P Q R | L M N S T U W X Y Z | V W X Y Z

Start decrypting

First current grid is grid D (earlier label than A with asterisk)

`R in D, later is A => reflect over horizontal => O, unused = CJ in C, later is D => reflect over vertical => G, unused = BV in B, later is C => reflect over horizontal => R, unused = AH in A, later is B => reflect over vertical => E, END`

Decrypted word: OGRE