TDD Functional Scala Mars Rover Kata Pt 2

Part 2 of the TDD functional scala mars rover kata implementation.

[@shakilhaque1822]

absolute legend mate

[@oliviersainteve8710]

Hello, this is a great video in my opinion, but I think you missed 2 points : first, a question: how many times can you move back from (3,1) (and how many cases (3,1) do exist)? Second, when passing from (1,1) to (5,1) (moving backward) I think you should invert the heading (N -> S, or S -> N). To get these ideas, I imagined a cylinder, with left and right columns (x=1 and x=5) linked each other. Then, the bottom row (y=1) is a circle, if you fold it the right way, passing from a circle shape to a line shape, you get the transformation given in the kata, with a last problem for (3,1) because the corresponding case by the transformation is itself.

[@shakilhaque1822]

Bro any chance you planning to the kata checkout tutorial?