A note on parallelism for the Towers of Hanoi

✍ Scribed by X.-M Lu; T.S Dillon

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 454 KB
• Volume: 20
• Category: Article
• ISSN: 0895-7177
• DOI: 10.1016/0895-7177(94)90028-0

✦ Synopsis

recent paper [l] introduces parallel moves to the Towers of Hanoi problem. In this proposed version of parallelism, however, more moves are 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 problem is not preserved. This current note considers a modified version of the problem by avoiding the extra moves. Both recursive and nonrecursive algorithms are given for the optimal solution.