← Back to Cognitive Train

🗼 Tower of Hanoi

⚡ Quick Start

Goal: Move all disks to Peg C
Click a peg to pick up its top disk, then click another peg to place it
Rule: You cannot place a larger disk on top of a smaller one
Trains recursive thinking, planning ahead, and problem decomposition
Puzzle Summary
📘 Detailed Instructions

Tower of Hanoi is a classic mathematical puzzle invented in 1883. The objective is to move an entire stack of disks from one peg to another, following specific rules.

Rules:

Optimal Solution (Classic Mode):

Strategy Tip: Think recursively! To move n disks from A to C: first move n-1 disks from A to B, then move the largest disk from A to C, then move n-1 disks from B to C.