TOWER OF HANOI
Please note that the material on this website is not intended to be exhaustive.
This is intended as a summary and supplementary material to the required textbook.
Given:
- 3 pegs labelled A , B, C
-
n disks labelled 1, 2, 3, ..., N where 1 is the smallest disk and N is the largest disk
- Initially, all n disks are piled in peg A according to size with the smallest on top
Objective:
- To move all n disks one disk at a time
-
from peg A (original source peg) to peg C (original destination peg) via peg B
(original auxiliary peg)
- such that at no time may a larger disk be on top of a smaller disk.
Observe that
| BASE CASE: |
n = 1 |
| RECURSIVE CASE: |
n > 1 |
EXAMPLE: n = 3
© 2000-07-07 cpsm ; last update
2007-08-19 20:51