Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The towers of Hanoi: yet another nonrecursive solution

The towers of Hanoi: yet another nonrecursive solution Another nonrecursive algorithm for The towers of Hanoi Problem is presented. It serves to compute the disk configuration from a given move number and the disk to be moved together with its current peg and target. The procedure gives rise to detect faults in erroneous computations. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGPLAN Notices Association for Computing Machinery

The towers of Hanoi: yet another nonrecursive solution

ACM SIGPLAN Notices , Volume 20 (9) – Sep 1, 1985

Loading next page...
 
/lp/association-for-computing-machinery/the-towers-of-hanoi-yet-another-nonrecursive-solution-MF3FVV0amP

References (8)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1985 by ACM Inc.
ISSN
0362-1340
DOI
10.1145/988364.988369
Publisher site
See Article on Publisher Site

Abstract

Another nonrecursive algorithm for The towers of Hanoi Problem is presented. It serves to compute the disk configuration from a given move number and the disk to be moved together with its current peg and target. The procedure gives rise to detect faults in erroneous computations.

Journal

ACM SIGPLAN NoticesAssociation for Computing Machinery

Published: Sep 1, 1985

There are no references for this article.