Magic of Tower of Hanoi Visualizer

An Interactive Simulation of the Tower of Hanoi Problem

Presented by: Department of Computer Science, University of Jammu

Recurrence: T(n) = 2ⁿ - 1

Total moves for 6 disks: 63

Fun Fact: Moving 64 disks at a rate of one per second would take roughly 585 billion years to complete—long past the projected heat death of our universe!

Time to Solve

02m:00s

Rules of the Game

Move Count: 0

Disks:

Towers:

Audio: Pause:

Algorithm used

Classic 3-peg algorithm

Animation Speed: 0

Magic of Tower of Hanoi Visualizer

Rules of the Game

Algorithm used

Display Settings