Here you have a simple version of a famous puzzle - the Towers of Hanoi.
The rules for playing are easy. All rings are put on the left or middle stick, the largest at the bottom, like shown at the picture. From now on, your goal is to put them onto the right stick in the same order, but there are some rules for moving the rings: Only one ring (the one at the top of a Tower) can be taken each time and put onto an empty tower or onto another tower, if the ring beyond it is larger.
If you´ve understood the rules and managed finishing the game, I have a new goal for you - finishing in as few moves as possible. If you have "n" rings for playing, the minimum amount of moves can be calculated by the formula <(2^n)-1>. Let´s see if you manage the six ring puzzle with 63 moves!
I'm a student who found his fascination for 3D Printing when our school got a 3D Printer. Furthermore I'm interested in modeling things with a CAD software. Have fun while browsing through my things!
If you have special wishes for things I could design, please let me know! :D