Try all paths with BFS or recursion. Count minimum jumps.
Exponential paths in worst case. Even with memoization, it's without further optimization.
Can you be greedy about which positions to jump to?
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The trap
Try all paths with BFS or recursion. Count minimum jumps.
Exponential paths in worst case. Even with memoization, it's without further optimization.
Can you be greedy about which positions to jump to?