UKMT volunteer Fraser Heywood kindly shared this video of his favourite mathematical puzzle with us. The Tower of Hanoi is a mathematical puzzle and a recursive algorithm, where the objective is to move an entire stack of disks from the source position to another position.
The three rules are:
- Only one disk can be moved at a time.
- A disk can only be moved if it is the uppermost disk on a stack.
- No larger disk may be placed on top of a smaller disk.
Read More