✦ LIBER ✦

An iterative algorithm for the Tower of Hanoi with four pegs

✍ Scribed by A. M. Hinz

Publisher: Springer Vienna
Year: 1989
Tongue: English
Weight: 363 KB
Volume: 42
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02239743

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative algorithm for the cyclic To

An iterative algorithm for the cyclic Towers of Hanoi problem

✍ M. C. Er 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 300 KB

Performance evaluations of recursive and

Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi problem

✍ M. C. Er 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 425 KB

On the Frame-Stewarr algorithm for the m

On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract)

✍ Sandi Klavžar; Uroš Milutinović; Ciril Petr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 73 KB

An iterative solution to the generalized

An iterative solution to the generalized Towers of Hanoi problem

✍ M. C. Er 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 455 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.

A Linear space algorithm for solving the

A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc

✍ M.C. Er 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 352 KB