Though if it is dynamic programming, then it should be possible for you to answer dogecoinbase&#x27;s question using not much more computational power than you used to count them in the first place, right?<p>If you think of dynamic programming as counting the number of paths in a directed graph (in this case, from skimming the paper, the nodes correspond to border states), then given a path number, you can trace the path backwards through the graph, as long as you remember the number of paths ending in every vertex.