The Tower of Hanoi is a classic mathematical puzzle invented in 1883. Move all disks from peg A to peg C, one at a time, never placing a larger disk on a smaller one.
Minimum moves for 5 disks: 31. Can you do it?
Also try: Sliding Puzzle.
How to Play Tower of Hanoi Click a peg to select the top disk. Click another peg to move it there. Move all disks from A
There is no upper limit — keep practicing and challenge your personal best!
Yes! All FunHeap games work perfectly on phones and tablets.
Yes! Every game is 100% free with no hidden costs or registration.
Browse our full collection of 55+ free games at FunHeap.com.