AlexAffe
AlexAffe
Aug 8, 2017 · 1 min read

Thank you for the write up, it got me to dynamic programming once again. I got stuck some years ago, trying to solve the knapsack (or napsack) problem with dynamic programming, or therefore: recursion.
What I always wondered was, how can you be sure, that the hanoi algorithm will play by the rules? What if somewhere along the way, a bigger thing gets stacked onto a smaller? And, how can you be certain, that this is the fastest way to do it? How would a use-minimal-amount-of-steps solution look like?

Thanks again, really clean and good read. Recursion is a pleasent adventure into ones own mind, and shows me more often than not, where my cognitive limit seems to be and where I can stretch it a little.

    AlexAffe

    Written by

    AlexAffe