Tower of Hanoi

thingiverse

The tower of Hanoi created in these files consists of a rectangular base with 3 identical cylinder posts that hold 5 discs. Given a stack of n disks arranged with the largest on the bottom of a post and the smallest on the top, the challenge is to find the minimum number of moves to move the stack from one post to another. Moves are only allowed when a smaller disk is placed on top of a larger disk. Print Settings Printer Brand: SeeMeCNC Printer: Rostock MAX Notes: The tower printed with minimal issues. We slowed the printer speed down a good deal when printing the actual posts to prevent warping/melting. We kept the printer bed slightly hotter than usual and made sure to spray the bed with a good layer of hairspray to help with sticking. The discs need to have a sticky bed to prevent them popping off the bed before the print is complete. The initial files are in INCHES and the models in the photos were scaled down to 50% of the original size. How I Designed This We got our original inspiration for the tower from RcNerdHW’s model of the Tower of Hanoi on Thingiverse (http://www.thingiverse.com/thing:511557). Using Rhino, we have very few problems creating the base. The biggest challenge came with determining what size the holes on each disc needed to be in order to easily move on and off the posts. We came to a conclusion that with posts of 0.5 inches the discs needed to have a hole of 0.7 inches to get the fit that we wanted. There is one file for the base and one for the discs. We printed 5 different sets of discs, each in a different color, so that the tower was more visually appealing. All of our prints were scaled to 50% of the original size. Overview and Background You don't want to miss out on the opportunity to watch CO solve the Tower in RECORD time! https://www.youtube.com/watch?v=nm0ljMLemKs JC, ML, CO 12/2016 Lesson Plan and Activity The tower of hanoi has several applications in the classroom, which contributed to our decision to create this puzzle. The first is having students derive an equation for the minimum of moves it takes to move n discs successfully from one post to another (2n-1). Students can also use the tower of hanoi to practice their problem solving skills or to simply take a brain break. Finally, the tower can be used to introduce the world of combinatoric puzzles. Whatever your tower is for, it is a great piece to show anyone how fun it is it bring math to life with a 3D printer.