A free online Tower of Hanoi puzzle game. Challenge yourself with 3-7 disks and move the entire stack from peg A to peg C. You can only move one disk at a time and you can never place a larger disk on a smaller one. Use the Auto Solve feature to watch the optimal recursive solution in action, perfect for understanding algorithmic thinking.
Choose the number of disks (3-7).
Click a peg to pick up the top disk.
Click another peg to place it.
Move all disks to peg C to win!
For n disks, the minimum is 2ⁿ - 1 moves. For 4 disks, that's 15 moves. For 7 disks, that's 127 moves.
That's the rule! The puzzle requires that disks are always in decreasing size from bottom to top on every peg.
Free online tool — works in your browser, no sign-up required. Start using it right now.
Try It NowA cellular automaton simulation. Create life patterns, watch them evolve through generations, and discover emergent behavior.
Generate random mazes using DFS or Prim's algorithm, then solve them with BFS pathfinding.
Play Sudoku online with three difficulty levels. Get hints, check your solution, and let the solver help when you're stuck.
All free online tools for developers, designers, students, and creators.
Every tool works in your browser — no sign-up, no data collection.