Show HN: The Hanoi Tree

During the years I worked as a C programmer, I was always fascinated by AVL trees. I remember the first time I debugged the balancing of an AVL tree: it felt like I was looking at something alive. This was also thanks to the Borland C compiler I was using. That experience inspired the game I created. It combines the Tower of Hanoi with the logic of AVL trees. The ability to modify the tree’s structure significantly reduces the number of moves needed to reach the goal.

The game is completely free and playable directly in your brouser (No download required).

I hope it will be useful to students studying data structures and recursive functions.

To implement the game, I used Figma AI, primarily for the graphics.

Thanks! I don't have specific expertise in this area, but I can share what I've read. The Tower of Hanoi is indeed used in neuropsychology to study executive functions. There's also the Tower of London (Shallice, 1982), which measures planning, though research shows they measure different cognitive processes.

My game adds a dynamic tree structure that auto-balances via AVL logic, so players have to plan not just moves but the structure itself. I wonder if that could be useful as a more flexible tool for studying planning and adaptability.

Not my field, but I'd be very curious to hear from anyone who might find it relevant!