[level3]

For reference, here’s a code golf challenge for maze solving. It’s an “endless” challenge (meaning none of the code submissions are viewable) but the shortest sed solution is currently 98 bytes.

http://golf.shinh.org/p.rb?maze+solving

Not quite as hard as the OP, though, since the conditions are slightly easier: only 3 inputs are tested, all of them are the same size, and all of them have exactly one solution.

If I remember right, my overall approach was pruning dead-ends instead of a breadth-first search.

[kritixilithos]

Are you tails? Anyways, thanks for helping me tie with first place :)

[level3]

No, I’m clock. As you can see, my sed skills aren’t as good as tails :)

Now that I’m 10 bytes behind I might have to give it another try. Though I haven’t golfed in years :/

EDIT: Well, I checked my old code and found a few places to optimize. Now down to 95 bytes :)

[kritixilithos]

Reached 96 bytes (now where would that last byte be hmmmm). And as you can see, my sed skills aren't as good as yours either :)

Nice meeting a fellow golfer, this was fun :)