NARC
About
Browse
Create
Inspect
Numbers
Login
Edit Puzzle
Puzzle ID
↻
Title
Sequence Length
4
Difficulty
--
Easy
Medium
Hard
Color
Grid Sequence
Narrative
Construct the optimal prefix-free binary code (Huffman coding) for six symbols with the given frequencies. At each step, merge the two least-frequent symbols (breaking ties by taking the earlier symbol). Assign 0 to the left branch and 1 to the right branch. Encode bit 0 as grid value 0, bit 1 as grid value 9, and unused (padding) positions as grid value 5. Each row of the code grid corresponds to a symbol (A through F in order), and columns represent bit positions from MSB to LSB. The most frequent symbol gets the shortest code.
0
characters
Narrative Variants
+ Add Variant
No additional variants. The main narrative is saved as "original".
Your Info
(optional)
Name
Email
Submit for Review
Preview
Clear All
Preview (as solver sees it)
Reveal Narrative
Submit this puzzle?
Submitted!