Tower of Hanoi

The Tower of Hanoi is a classic puzzle involving three pegs and a set of disks of different sizes. The goal is to move all the disks from one peg to another, following two rules: only one disk can be moved at a time, and a larger disk cannot be placed on top of a smaller one. Strategy involves systematically moving disks between pegs to ultimately organize all disks in order of size on the target peg. It illustrates problem-solving, recursion, and planning, and is often used to teach algorithmic thinking.