A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
M. C. Er · International Journal of Computer Mathematics · 1986
A loopless algorithm for the Towers of Hanoi problem is formulated. This algorithm moves each disc in a constant time, independent of the number of discs. An empirical test reveals that this loopless algorithm is the fastest algorithm for solving the Towers of Hanoi problem.