Explorations in 4-Peg Tower of Hanoi
We verify that the presumed-optimal Frame-Stewart
algorithm for 4-peg Tower of Hanoi is optimal, for up to 20 discs.
In addition, we (a) develop a distributed Tower of Hanoi algorithm,
and (b) present 2D and 3D representations of the state transition graphs.
Finally, two variants (k-out-of-order and k-at-a-time) and an analogy with
distributed agent software are suggested.
Full Paper Download
Supplemental Web Materials