hacker.org

Not all browsers have identified themselves... Which was the first to do this?

I recorded the widths of the characters and calculated the lengths of the names in the document. The names in the answer were only one or two pixels off my calculated lengths (I measured the crossed-out words)

Took about 30 minutes (longest part was getting character widths!)

Solved this with exactly the same problem as OP.. I was also looking for "edge". I used a DFS with a few optimisations. The first was avoiding checking "opposites" such as UD or LR, the second was avoiding visited positions (which I think saved a lot of time) and the third was re...

How long does the solution take to find on your implementations? I'm using Perl and LWP and I've been running for a while here.. Serious buyers remorse. That and I've thought of two decent optimisations in the meantime. - Edit: Solved - Just a tip.. be very careful how you check your navigation.. le...

I swear I have the answer to this one as I used this method to write a similar puzzle for another site. Can someone check it's working please?

-----

EDIT:

Nevermind, let's say my documents were a little dated

tails wrote:You can try $x = "120" and see how the code works.

Haha! Can't believe I missed that!.. Cheers bud.

Is this challenge broken? I can't understand why my solution won't work, I've tested it a few times with data that I manually checked and it works. It doesn't 'remove' the X's.. it just stores the last two numbers read then re-adds them if it hits an X: $x = "93752xxx...."; @s = split(//, ...