# Morose Codes (Huntinality 2022)

Morose Codes | |
---|---|

Huntinality 2022 | |

CTO (Brick Zander) | |

Author(s) | Violet Xiao and Shuxin Zhan |

Answer | Click to revealCROZIER |

Statistics | |

No. solves | 152 |

No. total guesses | 616 |

Links | |

Puzzle | Link |

Solution | Link |

Stats | Link |

**Morose Codes** is a minimalist puzzle from the CTO round of Huntinality 2022. The puzzle contains very little content—its ten lines are each a short string of capital letters.

## Solve Path[edit | edit source]

From there, solvers might note a number of interesting patterns in the dots and dashes. One particular line that stands out is the sixth, which is dominated by long runs of dots with a few dashes interspersed in between. Counting up the number of dots in each run and indexing them into the alphabet yields `MORZSENUMS`

, which can be error-corrected to `MORSE NUMS`

.

Regardless of the string they end up breaking into, the solvers may realize that the string they just obtained is a hint towards the decryption of another string. The whole list of decryptions follow:

`MORSE NUMS`

- Solvers might recognize that digits in Morse Code consist of five inputs spanning at most two runs of consecutive dots or dashes. Line 2 fits this bill (and conveniently is chunked such that each bigram has a total of five inputs); it deciphers to`MA(I)TCHWITHATOZ`

.`MATCH WITH A TO Z`

- Line 5 doesn't seem to stand out much in terms of the letters it uses. Counting the number of inputs, however, reveals that it has exactly 26 inputs, one for each letter of the alphabet. Taking the letters at the dots (`ABEINRY`

) reveals a compelling anagram of BINARY with an extra E.`BINARY`

- Binary, especially the five-bit variation, is a common puzzlehunt extraction. Line 10, much like line 2, is conveniently chunked into bigrams of five inputs each; interpreting them as five-bit binary yields`READB(R)ACKWARDS`

.`READ BACKWARDS`

- Here, solvers can reverse the messages and attempt to read off a coherent message. The most compelling is line 9, reading`SWAPDITSAND(A)DAHS`

.`SWAP DITS AND DAHS`

- Solvers can try every message to see which one fits the transformation. This is revealed to be line 7, reading`BRAI(N)LLE`

.`BRAILLE`

- Braille letters are written using a binary 3x2 grid. One of the Morse messages provides such a grid by only using the two-input letters: line 1. Taking each three-letter chunk as a single Braille letter reveals`ASCII(S)ART`

.`ASCII ART`

- Line 8 only uses the three-input letters. Arranging them into a three-wide grid reveals that the dashes spell out`TAP(C)`

.`TAP`

- Solvers might recognize Tap Code as converting between letters and pairs of numbers between 1 and 5. Line 4 notably contains only letters that exclusively use one of dots or dashes, and the runs are between 1 and 5 inputs long. Treating each run as a number and converting reveals`CO(R)MBINEPAIRS`

.`COMBINE PAIRS`

- Solvers can try every message to see which one fits the transformation. This turns out to be line 3, reading`UN(O)ARY`

.`UNARY`

- At this point, solvers realize that they have come back to line 6, since it uses the unary extraction (i.e. counting dots). The answer here is`MOR(Z)SENUMS`

.

As it turns out, every decryption contains an extra letter; this is the extraction.

Solvers may also note that the strings are arranged alphabetically. Conveniently, the hints given by the decryptions form a cyclical ordering; using this to order the letters reveals the answerphrase.

## Track Differences[edit | edit source]

Like most of the puzzles in this hunt, this puzzle has a casual and an expert version. The changes here are minimal, however—the casual version only gets a single additional line of flavortext:

## Puzzle Elements[edit | edit source]

Minimalist Presentation - The puzzle contains ten lines of text, each of which is a string of capital letters

Morse Code - As heavily suggested by the title (and, if applicable, the casual version's flavortext), the first step is to convert each line to the equivalent Morse Code. Further steps differ between the ten lines:

Braille - Line 1 takes chunks of three letters (six inputs in total) and converts them to the equivalent letter in Braille.

Morse Code - Lines 2, 3, 7, and 9 involve Morse Code again, but the lines have to be reparsed in different ways to achieve a readable string.

Tap Code - Line 4 takes alternating runs of dots and dashes and converts them to the equivalent letter in Tap Code.

Alphabet Mapping - Line 5 is exactly 26 inputs long and consists mostly of dashes. The solver can thus assign each input a letter from A to Z in order and anagram the letters that appear on the dots.

Alphanumeric Substitution - Line 6 consists of long runs of dots separated by dashes; these runs have lengths that map to letters. Line 2 uses alphanumeric substitution more directly.

Bitmap - Line 8 draws out a 3-wide grid containing ASCII art of its answer.

Five-Bit Binary - Line 10 can be reparsed in groups of five inputs (that are conveniently two letters each) and interpreted as five-bit binary.

The Waterfall Effect - Deciphering each line provides information on the extraction of another line, which provides enough information for a sort.

Something Extra - Each decryption yields an extra letter in addition to its hint. These are the letters used in the answerphrase.