A NOTE ON PARALLELISM FOR THE TOWERS OF HANOI

A recent paper [1] introduces parallel moves to the Towers of Hanoi pr oblem. In this proposed version of parallelism, however, more moves ar e required to make certain composite moves, in addition to those that are necessary to achieve the objective in the standard framework, and therefore the minimum of the conventional moves in the standard proble m is not preserved. This current note considers a modified version of the problem by avoiding the extra moves. Both recursive and nonrecursi ve algorithms are given for the optimal solution.