✦ LIBER ✦

The towers of Hanoi problem with parallel moves

✍ Scribed by Jer-Shyan Wu; Rong-Jaye Chen

Book ID: 107766071
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 188 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90207-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The towers of Hanoi problem with cyclic

The towers of Hanoi problem with cyclic parallel moves

✍ Jer-Shyan Wu; Rong-Jaye Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 348 KB

An optimal algorithm to implement the Ha

An optimal algorithm to implement the Hanoi towers with parallel moves

✍ Jer-Shyan Wu; Yu-Kuo Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

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.

The towers of Hanoi problem

✍ Peter Buneman; Leon Levy 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Generalized sequencing problem “Towers o

Generalized sequencing problem “Towers of Hanoi”

✍ J. Bendisch 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 461 KB

The linear twin Towers of Hanoi problem

✍ Minsker, Steven 📂 Article 📅 2007 🏛 Association for Computing Machinery ⚖ 543 KB

The linear twin Towers of Hanoi problem

✍ Minsker, Steven 📂 Article 📅 2007 🏛 Association for Computing Machinery ⚖ 543 KB

We propose a simple new variation of the Towers of Hanoi problem, in which there are three pegs arranged in a row and there are two stacks (black, white) of n rings each, initially located on the end pegs. The object is to exchange the stacks in accordance with the usual Hanoi rules, and with the ad