A loopless approach for constructing a fastest algorithm for the towers of hanoi problem

Abstract

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.

Keywords:

• Iteration
• Loopless algorithm
• Towers of Hanoi

C.R. Categories:

• D.1.4
• G.2.1