Audio is streamed directly from the publisher (peertube.uno) as published in their RSS feed. Play Podcasts does not host this file. Rights-holders can request removal through the copyright & takedown page.
Show Notes
The Tower of Hanoi is a mathematical puzzle. The target of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
- Only one disk can be moved at a time.
- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack.
- No disk may be placed on top of a smaller disk.
You can download the 3D parts from https://github.com/pysimone/FreeCAD-Hanoi_Tower, print them and play to solve the puzzle.
Enjoy!