Tower of Hanoi is a logic puzzle where you move a stack of disks across three pegs, one disk at a time. The key rule is that a larger disk can never sit on a smaller disk, so each move requires planning, sequencing, and careful use of the spare peg.
Beginner practice: Choose 3 Disks to learn the basic Tower of Hanoi rule: move one disk at a time and never place a larger disk on a smaller disk.
The fewest possible moves for Tower of Hanoi is 2^n - 1, where n is the number of disks. For example, 3 disks can be solved in 7 moves, 4 disks in 15 moves, and 8 disks in 255 moves.
The goal is to move all disks from the first peg to the last peg, one disk at a time, without placing a larger disk on top of a smaller disk.
The app lets you choose from 3 to 8 disks, so you can start with an easier puzzle and increase the difficulty as you improve.
The move counter tracks how many valid disk moves you have made during the current game.
Yes. Use the restart button to reset the board, timer, and move counter for a new attempt.
The minimum number of moves is 2^n - 1, where n is the number of disks. For example, 3 disks require at least 7 moves.
Yes. You can mute or unmute sound effects and switch between light and dark theme modes.