hacker.org

it can be done in very few lines of python, but it gets a bit dirty ;) #!/usr/bin/env python import Image img = Image.open("stars.png") width, height = img.size print "".join([chr(int("".join(["1" if 200 < min(img.getpixel((x,y))) else "0" for x in x...

The last three names were quite easy, but for the first and the second I did some calculations. It probably was quite an overkill, but at least I got the solution right on my first try ;-). This is the list I got: (values are in pixels) Haack: 64 Ceicys: 66 Balcius: 72 Tarulis: 75 Ivinskis: 78 Berzi...

have a look at the list of people who solved this challenge:
http://www.hacker.org/challenge/solvers.php?id=117

you can see that many people solved it in the last few weeks, so it is very unlikely that there was a bug in this challenge.

Hey, I immediately had to think about Kenny McCormick from the south park series, because he always speaks so muffled.
But I have no clue how this could help solving the challenge...

Hey tschiew,
as you may have noticed the text is from a wikipedia article, so comparing it to the original is ridiculous, because wikipedia articles change over time.

Wow, that's so much easier, but I didn't think of this method when doing the challenge

Doing it with curl probably would have been the easiest choice here, since it were only one line. But I did it with a few lines of Python for my convenience: #!/usr/bin/env python # -*- coding: utf-8 -*- import urllib url = "http://www.hacker.org/challenge/chal.php" data = {"answer&qu...

What inputs are you talking about? There is no input for this one, so there is only one correct result.

karma-fusebox wrote:me too.

additionally, i have no idea why you are talking about chess.

mmm, I don't know. It was just the first thing which came to my mind after I read 'grandmaster'.

Maybe I should try a different approach.

I don't want to make it too easy for you, so I just say 'yes' without giving further hints

Ok, I see a stream of 608 bits, but I don't know what to do with it.
Is it true, that these 608 bits represent some sort of chessboard notation?
Do I have to search for the inventor after I found out what the chess constellation looks like?

I think I need some help here

seems like the challenges are getting easier
it's a matter of seconds if you use the python implementation *hint hint*

Ok, I finally got it. Try rounding to the sixth decimal digit.
This is odd since the wikipedia article says, the precision is about 7.225 decimal digits.

lol, I solved it without seeing anything at all.
I just typed in some sci-fi names which came to my mind.
I still have no clue how this challenge has to be solved programmatically.

As I read the title I immediately knew this was Vigenere, because I had it in school when we were talking about cryptography. But the decryption tool I wrote back then was not finished (it doesn't interpret the frequency analysis, so it can't find the key by itself), so i used the online version of ...