hacker.org

Nice idea, that efficient bounds check! I did three versions: The first version copied the 16x16 image into a 18x18 image with borders, so I did not need bound checking. I then could then implement flood fill with 1d indices, using appropriate strides for the 2d neighbors. That version worked with t...

I "solved" it in ~3 hours, but with backtracking, i.e. I would always give the shortest path. However, that took 76k cycles, and I spent the last days optimizing that down to <47k cycles, but all tries to improve on that would not work out anymore. So, finally, I realized that the shortest...

I have finally solved this level according to my local tests, but my answer will not be accepted. I am getting "Your program failed to run correctly", but I find that message rather unspecific. I realized that after some tries (trying to debug the error), I got the first maze correct, so ...

I have finally solved this level according to my local tests, but my answer will not be accepted. I am getting "Your program failed to run correctly", but I find that message rather unspecific. I wish that I had a better idea of what the error is, but to be honest – I just wish my program ...

I have problems with this. Yes, I have found some bug that allows me not to lose, but most of the time it does not count levels as done (but I end up in a screwed up state where the game does not stop either way).

I also shred the game to pieces, but did not find any interesting piece at all.