Feedback | Home

MIT Mystery Hunt Puzzle Index: Keyword Data

binary/biliteral/Baconian cipher

This includes any 5-bit binary for letters in alphabetical order. The binary cipher usually goes from 00001 for A up to 11010 for Z. The Baconian cipher, and for Sir Francis Bacon, usually starts at 00000 for A, and classically (because of old Latin rules) combined I and J as one letter and likewise for U and V. Modern implementations often ignore the IJ/UV pairing and just work as an odd-by-one version of the binary cipher. Finally, either of these may be presented as a biliteral cipher, which means the binary is hidden as two variations of items within a cover text of some sort. It's up to you to figure out which variation is 0 and which is 1, but usually not hard to determine.

Puzzles

MIT Mystery Hunt 2000 The Play's the Thing
MIT Mystery Hunt 2003 Pop Quiz
MIT Mystery Hunt 2003 Whoa-I Know Knitting
MIT Mystery Hunt 2005 Blue Meta
MIT Mystery Hunt 2006 Kuala Lumpur Meta
MIT Mystery Hunt 2006 Up, Down, and All Around
MIT Mystery Hunt 2008 Let Me Tell You the Story
MIT Mystery Hunt 2009 The Sexaholics of Truthteller Planet
MIT Mystery Hunt 2010 Bits and Pieces
MIT Mystery Hunt 2011 Magnitude
MIT Mystery Hunt 2011 The Crypt
MIT Mystery Hunt 2011 The Sport of Princesses
MIT Mystery Hunt 2012 Fulfilling Puzzle
MIT Mystery Hunt 2012 Watson 2.0 Meta
MIT Mystery Hunt 2013 Take Home Final (Physics 101 Meta)
MIT Mystery Hunt 2013 Loss by Compression
MIT Mystery Hunt 2013 50/50
MIT Mystery Hunt 2014 Gone with the Wind
MIT Mystery Hunt 2015 Les Faux Amis Valent Rien
MIT Mystery Hunt 2016 Quantum Minesweeper
MIT Mystery Hunt 2017 Hand Them Over!
MIT Mystery Hunt 2017 Basic Phrenology

Categories

Codes

Home