Editing Towers of Hanoi (section)

== Demonstration ==

# Set out the Towers of Hanoi. Each one gets four washers, stacked from biggest to smallest on one side.
# When students come up to the demonstration, explain to them that they are to find the smallest number of steps needed to move the stack of washers from one peg to another. They must follow these rules:
## They can only move one washer at a time, with each move counting as one step.
## They cannot stack a larger washer on top of a smaller washer.
## When they find an answer, they have to show it to you.
# Allow students to play with the Towers of Hanoi. Encourage students to try it with one, two or three rings before trying it with four, and to write down the number of steps each one takes. Can they solve the pattern?