Problem 45426. The Tortoise and the Hare - 02
This problem is not really about DP or GA, but it is still good.
DP or GA require few test cases, or it can quickly grow beyond what is computational through current technology. For instance, 400 steps going ve or -ve, would require a tree with 2^401-1 nodes. It doesn't matter how we choose to traverse this tree, greedy or DP, it would only be fast to find a solution if there were many possible solutions (for this problem, there are just a few correct ones).
Problem Recent Solvers7
Determine whether a vector is monotonically increasing
Replace multiples of 5 with NaN
How long do each of the stages of the rocket take to burn?
More from this Author165
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!