This paper proposes a variant of the towers of Hanoi problem allowing parallel moves. An algorithm for this problem is presented and proved to be optimal.
WU, J., & CHEN, R. (1992). THE TOWERS OF HANOI PROBLEM WITH PARALLEL MOVES. INFORMATION PROCESSING LETTERS, 44(5), 241–243. https://doi.org/10.1016/0020-0190(92)90207-C