Puzzle 201
During the recent BrainBashers cipher convention, a binary code contest took place.
The contest consisted of a binary code transmission where the spaces between the letters were missing and there was no punctuation.
Each letter of the alphabet was translated into its binary equivalent based on its position in the alphabet. The resulting code was then blocked in groups of five digits.
Can you find 10 girl's names?
a=1, b=10, c=11, d=100, e=101, f=110, g=111, h=1000, i=1001, j=1010, k=1011, l=1100, m=1101, n=1110, o=1111, p=10000, q=10001, r=10010, s=10011, t=10100, u=10101, v=10110, w=10111, x=11000, y=11001, z=11010
11001 11000 11001 01110 01
10001 11101 11011 000
11001 10101 10010 10111 10
11101 00111 11111 10010 1
11101 11110 1001
10010 11110 00101 1100
10101 11110 01010 01111 0
11010 11001 00101 01110 01
10011 11110 10010 0101
10010 11110 10011 00111 01
Puzzle 202
Hidden in the grid below are six hidden animals.
The letters are in sequence, but you move from letter to letter using the moves of a chess knight.
Once you have crossed off all of the animals, you will be left with seven unused letters.
What animal do these letters spell?
The moves of a knight are:
Note: this puzzle is not interactive, and the letters cannot be clicked.
Puzzle 203
Below you will find well-known eight-letter words, with only their endings remaining.
Can you find the words?
-----rue
-----jar
-----dil
-----any
-----pox
-----gth
-----elf
-----oia
-----ige
-----hog
-----too
-----dix
-----fin
-----upt
Puzzle 204
Can you make this equation correct by moving exactly one matchstick?
Note: this puzzle is not interactive, and the matchsticks cannot be moved. The matchstick layouts for each digit are:
