An optimal algorithm to implement the Hanoi towers with parallel moves

摘要

In 1992, Wu and Chen proposed a new variant of the tower of Hanoi problem allowing parallel moves, and derived the minimum number of disk moves. This paper proposes an optimal iterative algorithm to implement it.