Affiliation:
1. Technische Universität Berlin, Berlin
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献