That was a nice one!
How big were your solutions? Mine was 4370 characters or 4324 opcodes.
I had to write a small compiler/assembler to calculate the jump offsets for me..,
Labyrinth
- dangermouse
- Posts: 89
- Joined: Sun Jun 05, 2011 8:14 pm
- Location: deep space computing AG
- Contact:
My Code has 208 instructions.
It will solve the maze always in the cycle limit.
But I was a bit lazy, I copied most of the code just from my Deluge and Flash Flood Warmup programm, worked perfectly at the first try.
It is a recursive approach from the end.
But why is there no following Challenge like 'Fast Labyrinth'?
It will solve the maze always in the cycle limit.
But I was a bit lazy, I copied most of the code just from my Deluge and Flash Flood Warmup programm, worked perfectly at the first try.
It is a recursive approach from the end.
But why is there no following Challenge like 'Fast Labyrinth'?
-
- Posts: 5
- Joined: Fri Aug 16, 2013 11:53 am
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 path was not required, so I got rid of the backtracking and got below 40k cycles.
However, something's fishy: I got some "program failed to execute correctly" messages when first trying to commit, with what's running perfectly locally. Did not find out what that was, in a later retry, it just worked.
So, finally, I realized that the shortest path was not required, so I got rid of the backtracking and got below 40k cycles.
However, something's fishy: I got some "program failed to execute correctly" messages when first trying to commit, with what's running perfectly locally. Did not find out what that was, in a later retry, it just worked.