Tower of Hanoi problem is one of the most obvious problem to illustrate how recurrence works. However, my point was to solve it without recurrence. Having used stack, I manually simulated "recurrence". In fact, it's the same algo, but implemented it another way: function does not call itself