# Towers of Hanoi | KIRUPA

**URL:** <https://forum.kirupa.com/t/towers-of-hanoi-kirupa/636496>\
**Category:** programming\
**Created:** [April 26, 2017, 3:22am UTC](https://forum.kirupa.com/t/towers-of-hanoi-kirupa/636496 "2017-04-26T03:22:30Z")\
**Posts on this page:** 3\
**Page:** 1

<div class="post-metadata">

**Author:** ![kirupa](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/kirupa/32/11616_2.png) [@kirupa](https://forum.kirupa.com/u/kirupa)\
**Post date:** [April 26, 2017, 3:22am UTC](https://forum.kirupa.com/t/towers-of-hanoi-kirupa/636496/1 "2017-04-26T03:22:30Z")

</div>

As puzzles go, nobody really did it better than the monks who came up with the one we are going to learn about, the **Towers of Hanoi**. Besides being a really cool puzzle, it has a lot of practical (and historical!) significance as we learn about recursion.

* * *
This is a companion discussion topic for the original entry at [http://www.kirupa.com/html5/tower\_of\_hanoi\_puzzle.htm](http://www.kirupa.com/html5/tower_of_hanoi_puzzle.htm)

---

<div class="post-metadata">

**Author:** ![Anonymousme](https://avatars.discourse-cdn.com/v4/letter/a/71c47a/32.png) [@Anonymousme](https://forum.kirupa.com/u/Anonymousme)\
**Post date:** [May 19, 2017, 5:05am UTC](https://forum.kirupa.com/t/towers-of-hanoi-kirupa/636496/2 "2017-05-19T05:05:19Z")

</div>

Representation of image was helpful in understanding the Towers of Hanoi.

---

<div class="post-metadata">

**Author:** ![kirupa](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/kirupa/32/11616_2.png) [@kirupa](https://forum.kirupa.com/u/kirupa)\
**Post date:** [May 19, 2017, 11:09am UTC](https://forum.kirupa.com/t/towers-of-hanoi-kirupa/636496/3 "2017-05-19T11:09:48Z")

</div>

I’m glad you liked it. I am fiddling with a fully animated example as well, so hopefully it will go up soon 😛