GeneralSolvesv1

Three Tower of Hanoi disks require seven moves

Move the upper stack aside, move the largest disk, then rebuild the stack.

Output

All disks transferred legally in the minimum seven moves

Input

Three different-sized disks stacked largest to smallest and two empty pegs

Input

Three different-sized disks stacked largest to smallest and two empty pegs

All disks transferred legally in the minimum seven moves

Relationship

Move the top two disks to a spare peg in three moves, move the largest disk once, then move the two-disk stack onto it in three more moves.

en.wikipedia.org: Three Tower of Hanoi disks require seven movesen.wikipedia.orgCC-BY-SA-4.0