Help break this code!

[timmeh87]

the problem with morse code is that all the letters are different lengths. so there would be like 100 ways to convert it... which means im too lazy to try. lol.

[Kai]

jep thats the major problem

[sgtpepper]

Ok, I got another clue out of him, he said try a "binary tree". I'm in the process of trying to figure out how it works... So any help would be greatly appreciated!

Thanks

[timmeh87]

http://en.wikipedia.org/wiki/Binary_tre ... nary_trees

heh. wtf

[HK-47]

Judging by what I see, the tree would look something like this:

Code: Select all

              47
             /  \
            /    \
           /      \
          /        \
         /          \
        /            \
       /              \
      22              59
     /  \            /  \
    /    \          /    \
   /      \        /      \
  51      36      64      63
 /  \    /  \    /  \    /  \
32  68  64  46  64  63  34  40

Copy it into notepad so the /s and \s dont look so crappy...
Now to figure out how to extract data...

[HK-47]

Nevermind... Thats not it. But now I know how binary trees work. Maybe you'll see somethign I miss.

First a root node is created like this:

Code: Select all

10

Any number that is added to this (a new node) is compared to the parent node (in this case, the root node). If the new node is higher in value to the parent node it goes to the right of it, while if it is smaller, it goes to the left. So, if we were to add a 5 to the tree it would look like this:

Code: Select all

   10
 /
5

And if we added a 15, it would look like this:

Code: Select all

   10
 /    \
5      15

Now that that we have another "level" of nodes, any numbers that we add are compared to the root node, then then compared to the node that it is pointed to. For example, lets say we want to add 12, it would look like this:

Code: Select all

   10
 /    \
5      15
      /
    12

What happens here is that 12 is compared to the 10, and it is bigger, so it is sent right. It is then compared to the 15, because it is on the right of the 10. 12 is smaller than 15, so it is sent left, were it is inserted into the tree.

This kind of behaviour goes on and on, and thats how it works. How this even applies to the puzzle thing, I have no idea.

Go get some more hints!

[sgtpepper]

Well my dad did some research for me, and found a javascript to put the numbers into a binary tree, but from here we don't really know what to do...

http://i12.photobucket.com/albums/a243/ ... yTable.png

[joevennix]

In hex, the word IS translates to 49, 53. Perhaps we should be looking for those two numbers.

[sgtpepper]

Yeah either that, or "is" in binary which would be-

000010110110100101110011 (in lowercase)
0100100101010011 (in uppercase)

[gamefunatic]

this problem is almost too hard... i think your teacher is trying to stump you and when no one comes up with the answer he laughs at you and does it so simply that you all feel stupid... any way maybe it translates into something like "Loving math is cool", but yeah and instead of focusing on 49 and 53 focus on 16 and 2

[codeman]

well i think he meant that 16 was the most important number because you first need to convert the characters into their ascii hex value, and hex is base 16. Then there's probably a binary pattern, and binary is base 2, the "second most important" number. No time to look for one now though, this lab is kicking my butt.

[sgtpepper]

Yeah that's probably right gamefunatic, but that's half the reason I'm trying to do it. He's got a huge ego and he would be incredibly dissapointed if someone cracked his oh-so-mighty code.

And yeah codeman, that's EXACTLY what I think about this whole thing, because it just makes total sense with the HEX relating to 16, and when I told him about the HEX part he seemed mildly impressed that I had even gotten that far. So when I asked him about binary relating to the 2, he gave me the clue of "binary tree", so there's really no other explanation...