Tower of Hanoi
About this tool
Move a stack of three to eight discs from the first peg to the last, one at a time, never putting a larger disc on a smaller one. Drag the top disc, tap a source peg and then a target, or press 1, 2 and 3; an illegal move shakes and says why. The counter shows the moves so far against the minimum 2ⁿ − 1. Auto-solve continues optimally from whatever position the class reached, at a speed you choose, and can be paused. A discussion panel gives the table of minimum moves, the reason the number doubles and adds one, and the story Édouard Lucas invented with the puzzle in 1883.
Classroom ideas
- Let pairs solve 3, 4 and 5 discs, record the minimum moves and predict the number for 6 before checking.
- Pause the class midway and use Solve from here to show that the best path continues from any position.
- Open the discussion and ask how long 64 discs would take at one move per second.
Related tools
- Sudoku GeneratorGenerate 4x4, 6x6 and 9x9 sudokus with one solution at four levels; play on screen or print sheets.
- Estimation JarA jar fills with a random number of objects; teams estimate, then watch them lined up in tens and hundreds.
- Mental Math ChainStart with 6, double it, add 8, halve it… one step at a time, then reveal the answer and the whole chain.
- Number SequencesFind the next two terms and the rule: arithmetic, geometric, squares, triangular, Fibonacci-type and two-step.
- Compare NumbersWhich is greater: 3/4, 0.7 or 72%? Compare whole numbers, decimals, fractions and percents.
- Times Tables PracticeMultiplication and division facts for the projector or a timed challenge, with your own problem lists too.