Tower of Hanoi, adjacent moves only
Three pegs stand in a row: left, middle and right. Three disks of different sizes sit on the left peg, largest at the bottom. You move one disk at a time and may never place a larger disk on a smaller one. The twist: a disk may only move to an adjacent peg (left↔middle or middle↔right - never directly between left and right). What is the minimum number of moves to transfer all three disks to the right peg?
Show hints (2)+
- The largest disk can't jump from left to right - it must stop on the middle peg, and each of its moves needs every smaller disk parked on the other end.
- This gives with , so .
Answer
Reveal answer →Final answer
26
Create a free account to see the full worked solution and track your progress.
Interview format: Trading Aptitude Tests, Betting Game Rounds