Like you, I initially considered focusing on the junctions / choices / hallways, which I still think could work. But it's more complicated than focusing on the stepping stones, so I recommend relegating it to vn.
It seems backwards to "find a path through the maze to reach the (n-1)th junction." That is not a smaller version of the same problem.
Thank you for pointing this out. We thought about it further and realized the use of stepping stones is indeed a better method than our initial use of junctions.
recursive abstraction
Like you, I initially considered focusing on the junctions / choices / hallways, which I still think could work. But it's more complicated than focusing on the stepping stones, so I recommend relegating it to vn.
It seems backwards to "find a path through the maze to reach the (n-1)th junction." That is not a smaller version of the same problem.
Focus on this section as your next task.