Tower of Hanoi puzzle

This is a puzzle called Tower of Hanoi. This is a fun mathematical puzzle with simple rules.

 

RULES: 

You begin with the discs stacked in decreasing order on rod A (ie. Largest disc on the bottom, smallest disc on the top).

Only one disc can be moved at a time.

A disc can only be moved if it is the topmost disc on a stack.

A larger disc cannot be placed on top of a smaller disc.

The puzzle is solved when all the discs have been successfully moved from the starting rod A to either rod B or rod C, stacked in the same initial conical arrangement (ie. stacked largest to smallest).

 

If you like my models please boost, rate and like. If you really like them please follow me, all of your support helps me make more models like this.

Boost MeIf you like my models please boost