NOTE: As an updated note the starting position is (1,1) not (0,0) The question assumes the from makes 6 moves up in total and 6 moves right Hope this helps clear up any confusion
cartesian cords has my pixel cord system brain scrambled
What’s the correct answer? 252?
The problem statement is missing a couple of constraints. One is stated as "obvious" in the video (no repeated paths), but strictly speaking, the problem is asking for the shortest possible paths. Getting from (0, 0) to (6, 6) in 18 steps is also a path, for example.
@jwh523