The towers of Hanoi is a classic mathematical brain teaser that shows the fundamentals of binary counting. The goal is to move all the discs to the third tower. Can you solve it?

Here are the rules:

• You can only move one disc at a time.
• You can only move the top disc on a tower.
• When placing a disc, you cannot place a larger disc on top of a smaller one. You can only place a smaller disc on a larger one.

This is a very easy print. The only point of contention is that you must be able to clear a 0.5mm tolerance gap in order for the discs to fit on the towers.

Print settings:

• Layer height: 0.15- 0.30mm
• Shells: 2