A rock climber wants to get from the bottom of a rock to the top by the safest possible path. At every step, he reaches for handholds above him; some holds are safer than other. At every step our climber can reach exactly three handholds: above, above and to the right and above and to the left. Every rock have a danger rating. The “Danger” of a path is the sum of danger ratings of all handholds on the path.
This visualizer shows the exact proccess of finding out the optimal path to complete the Climb using dynamic programming.