This paper discusses a variant of the towers of Hanoi problem with cyclic parallel moves. We propose an algorithm for this problem and show that the algorithm is optimal.
WU, J., & CHEN, R. (1993). THE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVES. INFORMATION PROCESSING LETTERS, 46(1), 1–6. https://doi.org/10.1016/0020-0190(93)90187-E