Torre de Hanoi

Play Tower of Hanoi online free at PlayDeck -- no download, no signup required. The Tower of Hanoi is a classic mathematical puzzle invented by French mathematician Edouard Lucas in 1883. It is one of the most studied problems in computer science and a beautiful example of recursive thinking. The puzzle consists of three pegs and a set of discs of different sizes, initially stacked on the first peg in decreasing order (largest on bottom). Your goal is to move the entire stack to the last peg, following two rules: you can only move one disc at a time, and you can never place a larger disc on top of a smaller one. The minimum number of moves required is 2^n - 1, where n is the number of discs. Three discs require 7 moves, four discs require 15, five discs require 31, and so on. The challenge grows exponentially, making larger puzzles genuinely difficult even when you know the algorithm. The recursive solution is elegant: to move n discs from peg A to peg C, first move n-1 discs from A to B (using C as helper), then move the largest disc from A to C, then move the n-1 discs from B to C (using A as helper). Understanding this recursive pattern is a gateway to understanding recursion in programming. The Tower of Hanoi is widely used in computer science education to teach recursion, algorithm design, and mathematical induction. It also serves as an excellent brain trainer that improves planning, sequencing, and problem-solving skills. According to legend, monks in a temple are solving a 64-disc version. When they finish, the world will end -- but at one move per second, it would take 585 billion years. Play Tower of Hanoi unblocked on PlayDeck -- free on any device.