✦ LIBER ✦

The towers of Hanoi revisited: Moving the rings by counting the moves

✍ Scribed by T.R. Walsh

Book ID: 113162481
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 572 KB
Volume: 15
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90108-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The towers of Hanoi problem with paralle

The towers of Hanoi problem with parallel moves

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

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 density function of the number of mo

The density function of the number of moves to complete the Towers of Hanoi puzzle

✍ F. Scarioni; M. G. Speranza 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 347 KB

Learning legal moves in planning problem

Learning legal moves in planning problems: A connectionist approach to examining legal moves in the tower-of-hanoi

✍ Andrew Sohn; Jean-Luc Gaudiot 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 561 KB

The super towers of Hanoi problem: large

The super towers of Hanoi problem: large rings on small rings

✍ Carole S. Klein; Steven Minsker 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 919 KB