# Solving the Tower of Hanoi with recursive Svelte templates

**URL:** <https://forum.devtalk.com/t/solving-the-tower-of-hanoi-with-recursive-svelte-templates/8770>\
**Category:** Blogs/Articles/Talks/Podcasts\
**Tags:** svelte, in-the-news\
**Created:** [14 April 2021 01:36 UTC](https://forum.devtalk.com/t/solving-the-tower-of-hanoi-with-recursive-svelte-templates/8770 "2021-04-14T01:36:25Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![CommunityNews](https://forum.devtalk.com/user_avatar/forum.devtalk.com/communitynews/32/1113_2.png) [@CommunityNews](https://forum.devtalk.com/u/CommunityNews)\
**Post date:** [14 April 2021 01:36 UTC](https://forum.devtalk.com/t/solving-the-tower-of-hanoi-with-recursive-svelte-templates/8770/1 "2021-04-14T01:36:25Z")

</div>

> The [Tower of Hanoi](https://en.wikipedia.org/wiki/Tower_of_Hanoi) is a classic mathematical puzzle that is often used as an introduction to recursion. We can express a solution to this problem only using Svelte’s template syntax…

> **[Solving the Tower of Hanoi with recursive Svelte templates - Geoff Rich](https://geoffrich.net/posts/svelte-tower-of-hanoi/)**

_This thread was posted by one of our members via one of our news source trackers._