I always see the Tower of Hanoi problem exemple when reading about recursion, but I honestly had never implemented it, so I decided to understand it. I mean, should be easy.. after all, it’s cited everywhere..

Tower of Hanoi Animation

Well, it took longer than I expected for the algorithm to make sense to me, there are explanations everywhere, and this is the page that really helped me to really understand the recursive algorithm.

After implementing it, it was still kind of blurry, so I had the great idea of creating a canvas animation with the step by step solution to really fix it in my head. I added the results into the projects page, and you can take a look at it here.