Reply
Tue 27 Jul, 2004 03:29 am
37; 35; 34;36;38;
111110001100000111110011111001100011111000000
110000011000001100000011011011100001100000111
110011111000111100011001100000011000001100000
011011111111001111110011111001111100011000011
And what's the solution? I have no idea.. :/
I thought the code was binary.
1=a
10=b
11=c
100=d
101=e
etc.
But there are 6 consecutive zero's so this is not the right way to go. I also tried binary code which uses 8 digits, but there are 180 digits, which is not divisible by 8.
a=01100001
b=01100010
etc.
whim
The answer is SLEEK.
The binary sequence is a bitmap. Notice that 37+35+34+36+38=180 which is the number of binary digits (bits).
The bitmap is five rows. The first row contains the first 37 bits. The second row contains the next 35 bits, and so on.
The L and the K are a little messed up.
A good way to view it is in Excel. Put the zeros and ones into five rows as described above. Highlight the region and apply conditional formatting (if cell value is 1, pattern is <pick a color>).
Nice.
Is this from an ARG (alternate reality game)?
Markr, I'm afraid, it's not a good answer.
It's from Hack Quest - I wrote here about it, because I really have no idea and I was thinking about it very long. Maybe it's easy, I don't know. The easiest things comes the longest.
What do you mean "it's not a good answer"? If you follow the instructions, it jumps right out at you. What else could it be?
I've replaced the 1's with #'s and the 0's with ^'s to make it as obvious as possible. How can SLEEK not be the answer?
#####^^^##^^^^^#####^^#####^^##^^^###
##^^^^^^##^^^^^##^^^^^##^^^^^^##^##
^###^^^^##^^^^^#####^^#####^^^####
^^^##^^##^^^^^^##^^^^^##^^^^^^##^###
#####^^######^^#####^^#####^^^##^^^^##
It's a good answer. Very good answer. Thanks. I'm sorry, I made a mistake.