hacker.org

First my solution looked like the one from sigi - but then i decided to add some fun to it:

I like the solution with the hash :P . This is how i found the solution: First I decompiled the whole thing and then recompiled it in c#. (just 4 fun) While running i took a look at the call stack. It showed that three functions are usign up all the cpu time. A closer look at those functions showed ...

to solve this one i decided to use c# :? 1) first i calculated the rotation with linear regression and rotated every image into horizontal position. That was the easy part. No I had to figure out some method to compare all those images... 2) I only used the R(ed) value of the images. Here the import...

10 000 000 000 cycles with hlife in golly - had the solution very quick - and u have also this nice gfx output

Here is a picture how the maze looked like when i solved it. The red point is the exit. I just forgot to mark the start point.

Well, my first try was with quicksort. But i couldn't optimize it to bring results under 11000 cycles

I then used the solution with a hash table - without collision detection. We have here only 128 entries - so just be happy.