@fellshard Same here... I did that for a bit...

That's what I love about these puzzles; the part A with hidden part B tests how you decide to reuse, refactor, and remodel your solution when confronted with change. It really is superb practice.

It really is. I had created a function that returns all the intermediate points in a line segment, but in retrospect I wish I'd done something like R8 L4 => R 1 1 1 1 1 1 1 1 L 1 1 1 1 instead

Basically what I ended up doing, translated relative rotations and steps into static directions, e.g. :east :east :east :north :north :west

from there it's trivial to generate a sequence of points visited