| authors |
Er, M.C. |
| year |
1981 |
| title |
A Representation Approach to the Tower of Hanoi Problem |
| source |
22 p. : ill. Wollongong: Department of Computing Science, University of Wollongong, August, 1981. includes bibliography |
| summary |
By making the moving direction of each disc explicit in the representation, a bit-string so constructed can be used to drive the Tower of Hanoi algorithm. The behavior of disc moves is further analyzed based on the bit-string representation. It has been shown that the bit-string for moving n discs can be used to generate successively the Gray codes of n bits |
| keywords |
representation, programming, combinatorics, algorithms, recursion |
| series |
CADline |
| references |
Content-type: text/plain
|
| last changed |
2003/06/02 13:58 |
|
